Verifiable Elections That Scale for Free
From MaRDI portal
Publication:4916026
DOI10.1007/978-3-642-36362-7_29zbMath1314.94060OpenAlexW2142750000MaRDI QIDQ4916026
Sarah Meiklejohn, Anna Lysyanskaya, Melissa Chase, Markulf Kohlweiss
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/55343624/Verifiable_Elections_That_Scale_for_Free.pdf
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Receipt-free secret-ballot elections (extended abstract)
- Malleable Proof Systems and Applications
- Quantum Communication Attacks on Classical Cryptographic Protocols
- Coercion-Resistant Electronic Elections
- Non-interactive Zero-Knowledge Arguments for Voting
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Securing threshold cryptosystems against chosen ciphertext attack
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- A Verifiable Secret Shuffe of Homomorphic Encryptions
- Succinct Malleable NIZKs and an Application to Compact Shuffles
- Verifiable Elections That Scale for Free
- Advances in Cryptology – CRYPTO 2004
- A Non-interactive Shuffle with Pairing Based Verifiability
- An Efficient Aggregate Shuffle Argument Scheme
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
This page was built for publication: Verifiable Elections That Scale for Free
