Ceremonies for End-to-End Verifiable Elections
From MaRDI portal
Publication:5738760
DOI10.1007/978-3-662-54388-7_11zbMath1400.94157OpenAlexW2591905428MaRDI QIDQ5738760
Aggelos Kiayias, Bingsheng Zhang, Thomas Zacharias
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/84765/1/main_ceremonies.pdf
Related Items (2)
Strategies for Voter-Initiated Election Audits ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
Cites Work
- Unnamed Item
- Receipt-free secret-ballot elections (extended abstract)
- Multi-Authority Secret-Ballot Elections with Linear Work
- End-to-End Verifiable Elections in the Standard Model
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting
- Coercion-Resistant Electronic Elections
- On Some Incompatible Properties of Voting Schemes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Applied Cryptography and Network Security
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
This page was built for publication: Ceremonies for End-to-End Verifiable Elections
