Simple verifiable elections

EVT 2006 - 2006 USENIX/ACCURATE Electronic Voting Technology Workshop

Volumn , Issue , 2006, Pages

  Benaloh, Josh ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; VOTING MACHINES;

COMPUTATIONALLY EFFICIENT; CRYPTOGRAPHIC TECHNIQUES; EFFECTIVE APPROACHES; END-TO-END VERIFIABILITY; VERIFIABLE ELECTIONS; VOTING SYSTEMS;

ELECTRONIC VOTING;

EID: 85030951416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Benaloh, J. “Verifiable Secret-Ballot Elections.” Yale University Ph.D. Thesis YALEU/DCS/TR-561. New Haven, CT (Dec. 1987).
2. Benaloh, J. and Tuinstra, D. “Receipt-Free Secret-Ballot Elections” Proceedings of the 26th ACM Symposium on Theory of Computing. Montreal, PQ (May 1994) 544-553.
3. Bruck, S., Jefferson, D., and Rivest, R. “A Modular Voting Architecture (“Frogs”).” Workshop on Theory of Elections. Tomales Bay, CA (Aug. 2001).
4. Boneh, D. and Franklin, M. “Efficient Generation of Shared RSA Keys.” Proceedings of Crypto'97. Santa Barbara, CA (Aug. 1997) 425-439.
5. Cramer, R., Damgård, I., and Nielsen, J. “Multiparty Computation from Threshold Homomorphic Encryption.” Proceedings of Eurocrypt 2001. Innsbruck, Austria (May 2001) 280-300.
6. Chaum, D. “Secret-Ballot Receipts: True Voter-Verifiable Elections.” IEEE Security & Privacy 2 1, (Feb. 2004), 38-47.
7. Chaum, D. “Recent Results in Electronic Voting.” Frontiers in Electronic Elections. Milan, Italy (Sep. 2005).
8. Chaum, D. “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms.” Communications of the ACM 24, 2, (Feb. 1981), 84-88.
9. Cramer, R., Gennaro, R., and Schoenmakers, B. “A Secure and Optimally Efficient Mult-Authority Election Scheme.” Proceedings of Eurocrypt'97. Konstanz, Germany (May 1997) 103-118.
10. Cohen (now Benaloh), J. and Fischer, M. “A Robust and Verifiable Cryptographically Secure Election Scheme.” Proceedings of the 26th IEEE Symposium on Foundations of Computer Science. Portland, OR (Oct. 1985), 372-382.
11. Chaum, D., Ryan P., and Schneider, S. “A Practical Voter-Verifiable Election Scheme.” Proceedings of the 10th European Symposium on Research in Computer Security. Milan, Italy (Sep. 2005), 118-139.
12. Desmedt, Y. and Frankel, Y. “Threshold Cryptosystems.” Proceedings of Crypto'89. Santa Barbara, CA (Aug. 1989) 307-315.
13. Diffie, W. and Hellman, M. “New Directions in Cryptography.” IEEE Transactions on Information Theory. IT-22, 6 (Nov. 1976), 644-654.
14. De Millo, R., Lynch, N., and Merritt, M. “Cryptographic Protocols.” Proceedings of the 14th ACM Symposium on Theory of Computing. San Francisco, CA (May 1982), 383-400.
15. ElGamal, T. “A Public-Key Cryptosystem and Signature Scheme Based on Discrete Logarithms.” IEEE Transactions on Information Theory. IT-31, 4 (Jul. 1985), 469-472.
16. Fiat, A. and Shamir, A. “How To Prove Yourself: Practical Solutions to Identification and Signature Problems.” Proceedings of Crypto'86. Santa Barbara, CA (Aug. 1986) 186-194.
17. Furukawa, J. “Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability.” Proceedings of PKC 2004. Singapore (Mar. 2004) 319-332.
18. Furukawa, J. and Sako, K. “An Efficient Scheme for Proving a Shuffle.” Proceedings of Crypto 2001. Santa Barbara, CA (Aug. 2001) 368-387.
19. Gennaro, R., Jarecki, S., Krawczyk, H., and Rabin, T. “Robust and Efficient Sharing of RSA Functions.” Proceedings of Crypto'96. Santa Barbara, CA (Aug. 1996) 157-172.
20. Goldwasser, S., Micali, S., and Rackoff, C. “The Knowledge Complexity of Interactive Proof Systems.” Proceedings of the 17th ACM Symposium on Theory of Computing. Providence, RI (May 1985), 291-304.
21. Groth, J. “A Verifiable Secret Shuffle of Homomorphic Encryptions.” Proceedings of PKC 2003. Miami, FL (Jan. 2003) 145-160.
22. Golle, P., Zhong, S., Boneh, D., Jakobsson, M., and Juels, A. “Optimistic Mixing for Exit-Polls.” Proceedings of Asiacrypt 2002. Queenstown, New Zealand (Dec. 2002) 451-465.
23. Jakobsson, M., Juels, A., and Rivest, R. “Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking.” Proceedings of the 2002 USENIX Security Symposium. San Francisco, CA (Aug. 2002), 339-353.
24. Neff, C.A. “A Verifiable Secret Shuffle and its Application to E-Voting.” Proceedings of the ACM Conference on Computer and Communications Security. Philadelphia, PA (Nov. 2001), 116-125.
25. Neff, C.A. “Election Confidence: A Comparison of Methodologies and Their Relative Effectiveness at Achieving It.” Document available from http://www.votehere.com/.
26. Neff, C.A. “Practical High Certainty Intent Verification for Encrypted Votes.” Document available from http://www.votehere.com/.
27. Peng, K., Boyd, C., and Dawson, E. “Simple and Efficient Shuffling with Provable Correctness and ZK Privacy.” Proceedings of Crypto 2005. Santa Barbara, CA (Aug. 2005) 188-204.
28. Pedersen, T. “A Threshold Cryptosystem Without a Trusted Party.” Proceedings of Eurocrypt'91. Brighton, UK (Apr. 1991) 522-526.
29. Park, C., Itoh, K., and Kurosawa, K. “Efficient Anonymous Channel and All/Nothing Election Scheme.” Proceedings of Eurocrypt'93. Lofthus, Norway (May 1993), 248-259.
30. Rivest, R., Shamir, A., and Adleman, L. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.” Communications of the ACM 21, 2 (Feb. 1978), 120-126.
31. Sako, K. and Kilian, J. “Receipt-Free Mix-Type Voting Scheme.” Proceedings of Eurocrypt'95. St. Malo, France (May 1995) 394-403.
32. Shamir, A. “How to Share a Secret.” Communications of the ACM 22, 11 (Nov. 1979), 612-613.
33. Shoup, V. “Practical Threshold Signatures.” Proceedings of Eurocrypt 2000. Bruges, Belgium (May 2000) 207-220.