Receipt-free electronic voting scheme with a tamper-resistant randomizer

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

Volumn 2587, Issue , 2003, Pages 389-406

  Lee, Byoungcheon ^a   Kim, Kwangjo ^b  

^a Joongbu University   (South Korea)

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

Author keywords

Divertible zero knowledge proof; Electronic voting; Receipt freeness; Tamper resistant randomizer

Indexed keywords

EID: 35248882057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36552-4_27     Document Type: Article

References (26)

1. M. Abe, "Universally verifiable mix-net with verification work independent of the number of mix-servers", Advances in Cryptology - Eurocrypt'98, LNCS Vol.1403, pages 437-447, Springer-Verlag, 1998.
2. J. Benaloh, "Verifiable secret-ballot elections", PhD Thesis, Yale University, Department of Computer Science, New Haven, September 1987.
3. 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, Pages 274-283, ACM Press, 2001.
4. J. Benaloh and D. Tuinstra, "Receipt-free secret-ballot elections", Proc. of 26th Symp. on Theory of Computing (STOC'94), pages 544-553, New York, 1994.
5. R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, "Multi-authority secret ballot elections with linear work", Advances in Cryptology - Eurocrypt'96, LNCS Vol.1070, pages 72-83, Springer-Verlag, 1996.
6. R. Cramer, R. Gennaro, and B. Schoenmakers, "A secure an optimally efficient multi-authority election schemes", Advances in Cryptology - Eurocrypt'97, LNCS Vol.1233, pages 103-118, Springer-Verlag, 1997.
7. D. Chaum, "Elections with unconditionally- secret ballots and disruption equivalent to breaking RSA", Advances in Cryptology - Eurocrypt'88, LNCS Vol.330, pages 177-182, Springer-Verlag, 1988.
8. D. Chaum, "Privacy Technology: A survey of security without identification", IACR Distinguished Lecture in Crypto2002, 2002.
9. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms", IEEE Trans. on IT, Vol.31, No.4, pages 467-472, 1985.
10. A. Fujioka, T. Okamoto, and K. Ohta, "A practical secret voting scheme for large scale election", Advances in Cryptology - Auscrypt'92, LNCS Vol.718, pages 244-260, Springer-Verlag, 1992.
11. 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.
12. M. Hirt and K. Sako, "Efficient receipt-free voting based on homomorphic encryption", Advances in Cryptology - Eurocrypt2000, LNCS vol.1807, pages 539-556, Springer-Verlag, 2000.
13. M. Jakobsson, "A practical mix", Advances in Cryptology - Eurocrypt'98, LNCS Vol.1403, pages 449-461, Springer-Verlag, 1998.
14. M. Jakobsson, K. Sako, and R. Impagliazzo, "Designated verifier proofs and their applications", Advances in Cryptology - Eurocrypt'96, LNCS Vol.1070, pages 143-154, Springer-Verlag, 1996.
15. B. Lee, and K. Kim, "Receipt-free electronic voting through collaboration of voter and honest verifier", Proceeding of JW-ISC2000, pages 101-108, Jan. 25-26, 2000, Okinawa, Japan.
16. E. Magkos, M. Burmester, V. Chrissikopoulos, "Receipt-freeness in large-scale elections without untappable channels", 1st IFIP Conference on E-Commerce / E-business / E-Government, Zurich, Octomber 2001, Kluwer Academics Publishers, pages 683-693, 2001.
17. M. Michels find P. Horster, "Some remarks on a receipt-free and universally verifiable mix-type voting scheme", Advances in Cryptology - Asiacrypt'96, LNCS Vol.1163, pages 125-132, Springer-Verlag, 1996.
18. V. Niemi and A. Rendall, "How to prevent buying of votes in computer elections", Advances in Cryptology - Asiacrypt'94, LNCS Vol.917, pages 141-148, Springer-Verlag, 1994.
19. T. Okamoto, "Receipt-free electronic voting schemes for large scale elections", Proc. of Workshop on Security Protocols'97, LNCS Vol.1361, pages 25-35, Springer-Verlag, 1997.
20. M. Ohkubo, F. Miura, M. Abe, A. Fujioka and T. Okamoto, "An Improvement on a practical secret voting scheme", Information Security'99, LNCS Vol.1729, pages 225-234, Springer-Verlag, 1999.
21. P. Paillier, "Public-key cryptosystems based on discrete logarithms residues", Advances in Cryptology - Eurocrypt '99, LNCS Vol. 1592, pages 223-238, Springer-Verlag, 1999.
22. B. Pfitzmann, "Breaking an efficient anonymous channel", Advances in Cryptology - Eurocrypt'94, LNCS Vol.950, pages 332-340, Springer-Verlag, 1994.
23. C. Park, K. Itoh, and K. Kurosawa, "Efficient anonymous channel and all/nothing election scheme", Advances in Cryptology - Eurocrypt'93, LNCS Vol.765, pages 248-259, Springer-Verlag, 1994.
24. D. Pointcheval, "Self-scrambling anonymizers", Proceedings of Financial Cryptography 2000, Y. Frankel, Pages 259-275, LNCS 1962, Springer-Verlag, 2001.
25. K. Sako and J. Killian, "Secure voting using partial compatible homomorphisms", Advances in Cryptology - Crypto'94, LNCS Vol.839, pages 411-124, Springer-Verlag, 1994.
26. 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 Vol.921, pages 393-403, Springer-Verlag, 1995.