How to Challenge and Cast Your e-Vote

DOI10.1007/978-3-662-54970-4_8zbMath1462.94038OpenAlexW2615476466MaRDI QIDQ5857773

Sandra Guasch, Paz Morillo

Publication date: 7 April 2021

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54970-4_8

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60)

Related Items

How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting ⋮ How to Challenge and Cast Your e-Vote

Cites Work

• New receipt-free voting scheme using double-trapdoor commitment
• Minimum disclosure proofs of knowledge
• Designated Verifier Proofs and Their Applications
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• Coercion-Resistant Electronic Elections
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• How to Challenge and Cast Your e-Vote
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item