How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting

DOI10.1007/978-3-030-92548-2_25zbMath1503.91056OpenAlexW4205820542MaRDI QIDQ2149844

Enrique Larraia, Tamara Finogina, Javier Herranz

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92548-2_25

zbMATH Keywords

electronic votingzero-knowledge systemscast as intended verifiabilitycoercion resistance

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Uses Software

• Helios

Cites Work

• Unnamed Item
• Efficient secure two-party protocols. Techniques and constructions
• Designated Verifier Proofs and Their Applications
• Coercion-Resistant Electronic Elections
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• How to Challenge and Cast Your e-Vote

This page was built for publication: How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting