Receipt-free universally-verifiable voting with everlasting privacy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4117 LNCS, Issue , 2006, Pages 373-392

  Moran, Tal ^a   Naor, Moni ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Receipt free voting human protocol universally composable formal proof

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

BALLOTS; DISCRETE LOG; UNIVERSAL COMPOSABILITY MODEL;

DATA PRIVACY;

EID: 33749582253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_22     Document Type: Conference Paper

References (21)

1. Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model. IEEE Transactions on Information Theory, 48(6):1668-1680, 2002.
2. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In STOC '94, pages 544-553, 1994.
3. 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.
4. R. Canetti and R. Gennaro. Incoercible multiparty computation. In FOCS '96, pages 504-513, 1996.
5. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
6. D. Chaum. Blind signature systems. In CRYPTO '83, page 153, 1983.
7. D. Chaum. E-voting: Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy, 2(1):38-47, Jan./Feb. 2004.
8. J. D. Cohen(Benaloh) and M. J. Fischer. A robust and verifiable cryptographically secure election scheme. In FOCS '85, pages 372-382, 1985.
9. R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secret-ballot elections with linear work. In EUROCRYPT '96, pages 72-83, 1996.
10. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Eurocrypt '97, pages 103-118, 1997.
11. A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In AUSCRYPT '92, volume 718 of LNCS, pages 244-251, 1993.
12. M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In Eurocrypt 2000, volume 1807 of LNCS, pages 539+, 2000.
13. A. Juels, D. Catalano, and M. Jakobsson. Coercion-resistant electronic elections. In WPES '05, pages 61-70, 2005.
14. C. Karlof, N. Sastry, and D. Wagner. Cryptographic voting protocols: A systems perspective. In USENIX Security '05, pages 33-50, 2005.
15. M. Naor and A. Shamir. Visual cryptography. In Eurocrypt '94, volume 950 of LNCS, pages 1-12, 1995.
16. C. A. Neff. Practical high certainty intent verification for encrypted votes, October 2004. http://www.votehere.net/vhti/documentation/vsv-2.0.3638. pdf.
17. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO '91, volume 576 of LNCS, pages 129-140, 1991.
18. D. J. Reynolds. A method for electronic voting with coercion-free receipt. FEE '05. Presentation: http://www.win.tue.nl/~berry/fee2005/ presentations/reynolds.ppt.
19. P. Y. A. Ryan. A variant of the Chaum voter-verifiable scheme. In WITS '05, pages 81-88, 2005.
20. K. Sako and J. Kilian. Receipt-free mix-type voting schemes. In EUROCRYPT '95, volume 921 of LNCS, pages 393-403, 1995.
21. A. Shamir. Cryptographers panel. RSA conference, 2006. Webcast: http://media.omediaweb.com/rsa2006/1_5/1_5_High.asx.