Split-ballot voting: Everlasting privacy with distributed trust

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2007, Pages 246-255

  Moran, Tal ^a   Naor, Moni ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BALLOT SECRECY; RECEIPT-FREE; SECURITY PROPERTIES; UNIVERSAL COMPOSABILITY; UNIVERSAL VERIFIABILITY; VOTING PROTOCOLS;

NETWORK PROTOCOLS;

NETWORK SECURITY;

EID: 77952345661     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1315245.1315277     Document Type: Conference Paper

References (23)

1. B. Adida and R. L. Rivest. Scratch & vote: self-contained paper-based cryptographic voting. In WPES '06, pages 29-40, 2006.
2. Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model. IEEE Trans. on Information Theory, 48 (6):1668-1680, 2002.
3. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In STOC '94, pages 544-553, 1994.
4. J. W. Bryans and P. Y. A. Ryan. A simplified version of the Chaum voting scheme. Technical Report CS-TR 843, University of Newcastle, 2004.
5. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067, 2000.
6. R. Canetti and R. Gennaro. Incoercible multiparty computation. In FOCS '96, pages 504-513.
7. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24 (2):84-88, 1981.
8. D. Chaum. E-voting: Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy, 2 (1):38-47, Jan./Feb. 2004.
9. D. Chaum, 2006. http://punchscan.org/.
10. J. D. Cohen (Benaloh) and M. J. Fischer. A robust and verifiable cryptographically secure election scheme. In FOCS '85, pages 372-382.
11. R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secret-ballot elections with linear work. In Eurocrypt '96, pages 72-83.
12. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Eurocrypt '97, pages 103-118.
13. A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In AUSCRYPT '92, pages 244-251.
14. M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In Eurocrypt '00, pages 539+.
15. T. Moran and M. Naor. Basing cryptographic protocols on tamper-evident seals. In ICALP '05, pages 285-297.
16. T. Moran and M. Naor. Receipt-free universally-verifiable voting with everlasting privacy. In CRYPTO, pages 373-392, 2006. http://www.wisdom.weizmann. ac.il/~talm/papers/MN06-votingpdf.
17. M. Naor and A. Shamir. Visual cryptography. In Eurocrypt '94, volume 950 of LNCS, pages 1-12, 1995.
18. C. A. Neff. Practical high certainty intent verification for encrypted votes, October 2004. http://www.votehere.net/vhti/documentation/vsv-2.0.3638pdf.
19. S. Popoveniuc and B. Hosp. An introduction to punchscan, 2006. http://punchscan.org/papers/popoveniuc-hosp-punchscan-introductionpdf.
20. M. O. Rabin. Transaction protection by beacons. J. Computer and System Sciences, 27 (2):256-267, 1983.
21. D. J. Reynolds. A method for electronic voting with coercion-free receipt. Presentation: http://www.win. tue.nl/~berry/fee2005/presentations/ reynolds.ppt.
22. P. Y. A. Ryan. A variant of the Chaum voter-verifiable scheme. In WITS '05, pages 81-88, 2005.
23. A. Shamir. Cryptographers panel, RSA conference, 2006. Webcast: http://media.omediaweb.com/rsa2006/1-5/1-5-High.asx.