A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting

DOI10.1007/978-3-540-89255-7_13MaRDI QIDQ3600375zbMATH OpenOpenAlexFDO

Authors Jason Keller, Joe Kilian

Publication date 10 February 2009

Published in Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89255-7_13

zbMATH Keywords

electronic votingsecure computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A comparative overview of cryptographic voting protocols
• Multi-authority secret-ballot elections with linear work
• scientific article; zbMATH DE number 176563
• scientific article; zbMATH DE number 5630773
• Financial Cryptography and Data Security

Cites work

• Achieving independence efficiently and securely
• Coercion-resistant electronic elections
• Electronic jury voting protocols
• Financial Cryptography
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to share a secret
• scientific article; zbMATH DE number 1583790 (Why is no real title available?)
• scientific article; zbMATH DE number 1676659 (Why is no real title available?)
• scientific article; zbMATH DE number 1842502 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• Practical multi-candidate election system
• Receipt-free secret-ballot elections (extended abstract)
• Simple and Efficient Shuffling with Provable Correctness and ZK Privacy

Cited in

(1)

• Financial Cryptography and Data Security

This page was built for publication: A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600375)