Providing receipt-freeness in mixnet-based voting protocols

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

Volumn 2971, Issue , 2004, Pages 245-258

  Lee, Byoungcheon ^a,b   Boyd, Colin ^a   Dawson, Ed ^a   Kim, Kwangjo ^c   Yang, Jeongmo ^b   Yoo, Seungjae ^b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b Joongbu University   (South Korea)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Designated verifier re encryption proof; Electronic voting; Mixnet; Re encryption; Receipt freeness; Tamper resistant randomizer

Indexed keywords

RANDOM PROCESSES; SECURITY OF DATA; VOTING MACHINES;

ELECTRONIC VOTING; MIX-NET; RE-ENCRYPTION; RECEIPT-FREENESS; TAMPER RESISTANT;

CRYPTOGRAPHY;

EID: 33750248003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24691-6_19     Document Type: Article

References (33)

1. [Abe98] M. Abe, "Universally verifiable mix-net with verification work independent of the number of mix-servers", Advances in Cryptology - Eurocrypt'98, LNCS 1403, Springer-Verlag, pp. 437-447, 1998.
2. [Abe99] M. Abe, "Mix-networks in permutation networks", Asiacrypt 1999, LNCS 1716, Springer-Verlag, pp. 258-273, 1999.
3. [AI03] M. Abe, and H. Imai, "Flaws in some robust optimistic mixnets", ACISP 2003, LNCS 2727, Springer-Verlag, pp. 39-50, 2003.
4. [Ben87] J. Benaloh, "Verifiable secret-ballot elections", PhD thesis, Yale University, Department of Computer Science, New Haven, CT, September 1987.
5. [Bau01] O. Baudron, P.-A. Fouque, D. Pointcheval, G. Poupard and J. Stern, "Practical multi-candidate election system", Proc. of the 20th ACM Symposium on Principles of Distributed Computing, N. Shavit Ed., pp. 274-283, ACM Press, 2001.
6. [BT94] J. Benaloh and D. Tuinstra, "Receipt-free secret-ballot elections", Proc. of 26th Symp. on Theory of Computing (STOC'94), pp. 544-553, New York, 1994.
7. [CFSY96] R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, "Multi-authority secret ballot elections with linear work", Advances in Cryptology - Eurocrypt'96, LNCS 1070, Springer-Verlag, pp. 72-83, 1996.
8. [CGS97] R. Cramer, R. Gennaro, and B. Schoenmakers, "A secure an optimally efficient multi-authority election schemes", Advances in Cryptology - Eurocrypt'97, LNCS 1233, Springer-Verlag, pp. 103-118, 1997.
9. [Cha88] D. Chaum, "Elections with unconditionally- secret ballots and disruption equivalent to breaking RSA", Advances in Cryptology - Eurocrypt'88, LNCS 330, Springer-Verlag, pp. 177-182, 1988.
10. [E1G85] T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms", IEEE Trans, on IT, Vol.31, No.4, pp. 467-472, 1985.
11. [ES] "Electoral systems", Administration and Cost of Elections Project, available at http://www.aceproject.org/main/english/es/
12. [FOO92] A. Fujioka, T. Okamoto, and K. Ohta, "A practical secret voting scheme for large scale election", Advances in Cryptology - Auscrypt'92, LNCS 718, Springer-Verlag, pp. 244-260, 1992.
13. [FS01] J. Furukawa and K. Sako, "An efficient scheme for proving a shuffle", Crypto 2001, LNCS 2139, Springer-Verlag, pp. 368-387, 2001.
14. [Gol02] P. Golle, S. Zhong, D. Boneh, M. Jakobsson, and A. Juels, "Optimistic mixing for exit-polls", Asiacrypt 2002, LNCS 2501, Springer-Verlag, pp. 451-465, 2002.
15. [Gro03] J. Groth, "A Verifiable Secret Shuffle of Homomorphic Encryptions", Appears in Public Key Cryptography - PKC 2003, LNCS 2567, Springer-Verlag, pp. 145-160, 2003.
16. [Hirt01] M. Hirt, "Multi-party computation: Efficient protocols, general adversaries, and voting", Ph.D. Thesis, ETH Zurich, Reprint as vol. 3 of ETH Series in Information Security and Cryptography, ISBN 3-89649-747-2, Hartung-Gorre Verlag, Konstanz, 2001.
17. [HS00] M. Hirt and K. Sako, "Efficient receipt-free voting based on homomorphic encryption", Advances in Cryptology - Eurocrypt2000, LNCS 1807, Springer-Verlag, pp. 539-556, 2000.
18. [Jak98a] M. Jakobsson, "A practical mix", Advances in Cryptology - Eurocrypt'98, LNCS 1403, Springer-Verlag, pp. 449-461, 1998.
19. [Jak98b] M. Jakobsson, "Flash mixing", Proc. of the 18th ACM Symposium on PODC'98, pp. 83-89, 1998.
20. [JSI96] M. Jakobsson, K. Sako, and R. Impagliazzo, "Designated verifier proofs and their applications", Advances in Cryptology - Eurocrypt'96, LNCS 1070, Springer-Verlag, pp. 143-154, 1996.
21. [Kim01] K. Kim, J. Kim, B. Lee, and G. Ahn, "Experimental design of worldwide Internet voting system using PKI", SSGRR2001, L'Aquila, Italy, Aug. 6-10, 2001.
22. [LK00] B. Lee, and K. Kim, "Receipt-free electronic voting through collaboration of voter and honest verifier", Proceeding of JW-ISC2000, pp. 101-108, Jan. 25-26, 2000, Okinawa, Japan.
23. [LK02] B. Lee, and K. Kim, "Receipt-free electronic voting scheme with a tamper-resistant randomizer", ICISC 2002, LNCS 2587, Springer-Verlag, pp. 389-406, 2002.
24. [MBC01] E. Magkos, M. Burmester, V. Chrissikopoulos, "Receipt- freeness in largescale elections without untappable channels", 1st IFIP Conference on E-Commerce / E-business / E-Government, Zurich, Octomber 2001, Kluwer Academics Publishers, pp. 683-693, 2001.
25. [Nef01] A. Neff, "A verifiable secret shuffle and its application to E-voting", ACM CCS 2001, ACM Press, pp. 116-125, 2001.
26. [Oka97] T. Okamoto, "Receipt-free electronic voting schemes for large scale elections", Proc. of Workshop on Security Protocols'97, LNCS 1361, Springer-Verlag, pp. 25-35, 1997.
27. [Ohk99] M. Ohkubo, F. Miura, M. Abe, A. Fujioka and T. Okamoto, "An improvement on a practical secret voting scheme", Information Security'99, LNCS 1729, Springer-Verlag, pp. 225-234, 1999.
28. [Pai99] P. Paillier, "Public-key cryptosystems based on discrete logarithms residues", Advances in Cryptology - Eurocrypt '99, LNCS 1592, Springer-Verlag, pp. 223-238, 1999.
29. [Ped91] T. Pedersen, "A threshold cryptosystem without a trusted party", Advances in Cryptology - Eurocrypt '91, LNCS 547, Springer-Verlag, pp. 522-526, 1991.
30. [PIK93] C. Park, K. Itoh, and K. Kurosawa, "Efficient anonymous channel and all/nothing election scheme", Advances in Cryptology - Eurocrypt'93, LNCS 765, Springer-Verlag, pp. 248-259, 1994.
31. [SK94] K. Sako and J. Kilian, "Secure voting using partial compatible homomorphisms", Advances in Cryptology - Crypto'94, LNCS 839, Springer-Verlag, pp. 411-424, 1994.
32. [SK95] K. Sako and J. Kilian, "Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth", Advances in Cryptology - Eurocrypt'95, LNCS 921, Springer-Verlag, pp. 393-403, 1995.
33. [Wik02] D. Wikstrom, "How to break, fix, and optimize optimistic mix for exit-polls", SICS Technical Report, T2002:24, available at http://www.sics.se/libindex.html, 2002.