Receipt-Free Universally-Verifiable Voting with Everlasting Privacy

DOI10.1007/11818175_22zbMath1161.68447OpenAlexW1603759597MaRDI QIDQ5756632

Moni Naor, Tal Moran

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_22

zbMATH Keywords

receipt-free voting human protocol universally composable formal proof

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (12)

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting ⋮ How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting ⋮ Cast-as-intended: a formal definition and case studies ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ Explainable arguments ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ Traceable receipt-free encryption ⋮ Short-lived zero-knowledge proofs and signatures ⋮ Ceremonies for End-to-End Verifiable Elections ⋮ Filling the gap between voters and cryptography in e-voting ⋮ A Tamper-Evident Voting Machine Resistant to Covert Channels ⋮ How to Challenge and Cast Your e-Vote

This page was built for publication: Receipt-Free Universally-Verifiable Voting with Everlasting Privacy