Coercion-resistant electronic elections

WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society

Volumn , Issue , 2005, Pages 61-70

  Juels, Ari ^a   Catalano, Dario ^b   Jakobsson, Markus ^c  

^a RSA   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Coercion resistance; Electronic voting; Mix networks; Receiptfreeness

Indexed keywords

COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; SECURITY SYSTEMS; TELECOMMUNICATION NETWORKS; VOTING MACHINES;

COERCION-RESISTANCE; ELECTRONIC VOTING; MIX NETWORKS; RECEIPTFREENESS;

ELECTRONIC EQUIPMENT;

EID: 33749009810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102199.1102213     Document Type: Conference Paper

References (42)

1. Proxyvote.com: Shareholder election website, 2005. URL: www.proxyvote.com.
2. Vote-auction, 2005. URL: www.vote-auction.net.
3. O. Baudron, P.-A. Fouque, D. Pointcheval, J. Stern, and G. Poupard. Practical multi-candidate election system. In PODC 2001, pages 274-283. ACM Press, 2001.
4. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security, pages 62-73. ACM, 1993.
5. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections (extended abstract). In 26th ACM STOC, pages 544-553, 1994.
6. M. Blum, A. D. Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM J. Comput., 20(6):1084-1118, 1991.
7. D. Boneh. The Decision Diffie-Hellman problem. In ANTS '98, pages 48-63. Springer-Verlag, 1998. LNCS no. 1423.
8. D. Boneh and P. Golle. Almost entirely correct mixing with applications to voting. In V. Atluri, editor, ACM CCS '02, pages 68-77. ACM Press, 2002.
9. S. Brands. Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, 2000.
10. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In B. Pfitzmann, editor, EUROCRYPT '01, pages 93-118. Springer-Verlag, 2001. LNCS no. 2045.
11. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, editor, CRYPTO '97, pages 410-424. Springer-Verlag, 1997. LNCS no. 1294.
12. R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky. Deniable encryption. In B. Kaliski, editor, CRYPTO '97, pages 90-104, 1997. LNCS no. 1294.
13. R. Canetti, R. Gennaro, S. J. H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. In M. Wiener, editor, CRYPTO '99, pages 98-115. Springer-Verlag, 1999. LNCS no. 1666.
14. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
15. R. Cramer, I. Damgard, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. Desmedt, editor, CRYPTO '94, pages 174-187. Springer-Verlag, 1994. LNCS no. 839.
16. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In W. Fumy, editor, EUROCRYPT '97, pages 103-118. Springer-Verlag. 1997. LNCS no. 1233.
17. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In H. Krawczyk, editor, CRYPTO '98, pages 13-25. Springer-Verlag, 1998. LNCS no. 1462.
18. M. Cross. Public domain. The Guardian: Guardian Unlimited Online, 10 June 2004.
19. J. Fowler. Switzerland tests virtual democracy in national referendum. Technology Review, 26 September 2004.
20. A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In J. Seberry and Y. Zheng, editors, ASIACRYPT '92, pages 244-251. Springer-Verlag, 1992. LNCS no. 718.
21. J. Furukawa. Efficient, verifiable shuffle decryption and its requirement of unlinkability. In B. et al., editor, PKC 04, pages 319-332. Springer-Verlag, 2004. LNCS no. 2947.
22. J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In J. Kilian, editor, CRYPTO '01, volume 2139 of Lecture Notes in Computer Science, pages 368-387. Springer-Verlag, 2001.
23. T. E. Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
24. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. The (in)security of distributed key generation in dlog-based cryptosystems. In J. Stern, editor, EUROCRYPT '99, pages 295-310. Springer-Verlag, 1999. LNCS no. 1592.
25. M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In B. Preneel, editor, EUROCRYPT '00, pages 539-556, 2000. LNCS no. 1807.
26. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, editor, Advances in Cryptology - Asiacrypt '00, pages 162-177. Springer-Verlag, 2000. LNCS No. 1976.
27. M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In D. Boneh, editor, USENIX '02, pages 339-353, 2002.
28. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In U. Maurer, editor, EUROCRYPT '96, pages 143-154. Springer-Verlag, 1996. LNCS no. 1070.
29. A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the 1999 ISOC Network and Distributed System Security Symposium, pages 151-165, 1999.
30. A. Kiayias and M. Yung. Self-tallying elections and perfect ballot secrecy. In D. Naccache and P. Paillier, editors, PKC '02, pages 141-158. Springer-Verlag, 2000. LNCS no. 2274.
31. P. MacKenzie, T. Shrimpton, and M. Jakobsson. Threshold password-authenticated key exchange. In M. Yung, editor, CRYPTO '02, pages 385-400, 2002. LNCS no. 2442.
32. E. Magkos, M. Burmester, and V. Chrissikopoulos. Receipt-freeness in large-scale elections without untappable channels. In B. S. et al., editor, First IFIP Conference on E-Commerce, E-Business, E-Government (I3E), pages 683-694, 2001.
33. M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In K. Kim and T. Matsumoto, editors, ASIACRYPT '96. Springer-Verlag, 1996. LNCS no. 1163.
34. A. Neff. A verifiable secret shuffle and its application to e-voting. In P. Samarati, editor, ACM CCS '01, pages 116-125. ACM Press, 2001.
35. V. Niemi and A. Renvall. How to prevent buying of votes in computer elections. In J. Pieprzyk and R. Safavi-Naini, editors, ASIACRYPT '94, pages 164-170. Springer-Verlag, 1994. LNCS no. 917.
36. T. Okamoto. An electronic voting scheme. In N. T. et al., editor, IFIP World Congress, pages 21-30, 1996.
37. T. Okamoto. Receipt-free electronic voting schemes for large scale elections. In B. C. et al., editor. Security Protocols Workshop, pages 25-35. Springer-Verlag, 1997. LNCS no. 1361.
38. S. Parker. Shaking voter apathy up with IT. The Guardian, 11 Dec. 2001.
39. K. Sako and J. Kilian. Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth. In L. Guillou and J.-J. Quisquater, editors, EUROCRYPT '95, pages 393-403. Springer-Verlag, 1995. LNCS no. 921.
40. B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In M. Wiener, editor, CRYPTO '99, pages 148-164. Springer-Verlag, 1999. LNCS no. 1666.
41. B. Schoenmakers, 2000. Personal communication.
42. Y. Tsiounis and M. Yung. On the security of ElGamal-based encryption. In Workshop on Practice and Theory in Public Key Cryptography (PKC '98). Springer, 1998.