Receipt-freeness for groth's e-Voting schemes

Journal of Information Science and Engineering

Volumn 25, Issue 2, 2009, Pages 517-530

  Han, Wei ^a   Chen, Ke Fei ^a   Zheng, Dong ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Designated verifier proof; Electronic voting; Homomorphic threshold encryption; Receipt freeness

Indexed keywords

HELIUM; IMAGE QUALITY; VOTING MACHINES;

CRYPTOGRAPHIC APPLICATIONS; DESIGNATED-VERIFIER PROOF; E-VOTING; ELECTRONIC VOTING; HOMOMORPHIC THRESHOLD ENCRYPTION; INTEGER COMMITMENTS; NON-INTERACTIVE; RECEIPT-FREE; RECEIPT-FREENESS; SECURITY PROPERTIES; THIRD PARTIES; ZERO-KNOWLEDGE;

CRYPTOGRAPHY;

EID: 63149128086     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (28)

1. J. Benaloh, "Verifiable secret ballot elections," Ph.D. Thesis, Department of Computer Science, Yale University, New Haven, 1987.
2. B. Schoenmakers, "A simple publicly verifiable secret sharing scheme and its application to electronic voting," in Proceedings of Advances in Cryptology - CRYPTO, LNCS 1666, 1999, pp. 148-164.
3. D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Communications of the ACM, Vol. 24, 1981, pp. 84-88.
4. A. Fujioka, T. Okamoto, and K. Ohta, "A practical secret voting scheme for large scale elections," in Proceedings of Advances in Cryptology -AUSCRYPT, LNCS 718, 1992, pp. 244-251.
5. R. Cramer, R. Gennaro, and B. Schoenmakers, "A secure and optimally efficient multi-authority election scheme," in Proceedings of Advances in Cryptology EUROCRYPT, LNCS 1233, 1997, pp. 103-118.
6. O. Baudron, P. A. Fouque, D. Pointcheval, G. Poupard, and J. Stern, "Practical multicandidate election system," in Proceedings of the 20th ACM Symposium on Principles of Distributed Computing, 2001, pp. 274-283.
7. I. Damgard and M. Jurik, "A generalisation, a simplification and some applications of Paillier's probabilistic public-key system," in Proceedings of Public Key Cryptography, LNCS 1992, 2001, pp. 119-136.
8. J. Benaloh and D. Tuinstra, "Receipt-free secret-ballot elections," in Proceedings of the 26th Annual Symposiums on the Theory of Computing, 1994, pp. 544-553.
9. K. Sako and J. Kilián, "Receipt-free mix-type voting system - A practical solution to the implementation of a voting booth," in Proceedings of Advances in Cryptology - EUROCRYPT, LNCS 921, 1995, pp. 393-403.
10. B. Lee and K. Kim, "Receipt-free electronic voting through collaboration of voter and honest verifier," in Proceedings of Joint Workshop on Information Security and Cryptology, 2000, pp. 101-108.
11. M. Hirt, "Mutlti-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, Hartungorre Verlag, Konstanz, 2001, ftp://ftp.inf.ethz.ch/pub/crypto/ publications/Hirt01.pdf.
12. M. Hirt and K. Sako, "Efficient receipt-free voting based on homomorphic encryption," in Proceedings of Advances in Cryptology -EUROCRYPT, LNCS 1807, 2000, pp. 539-556.
13. B. Lee and K. Kim, "Receipt-fee electronic voting scheme with a tamper-resistant randomizer," in Proceedings of the 5th Information Conference on Information Security and Cryptology, LNCS 2587, 2003, pp. 389-406.
14. J. Groth, "Non-interactive zero-knowledge arguments for voting," in Proceedings of International Conference on Applied Cryptography and Network Security, LNCS 3531, 2005, pp. 467-482, http://www.daimi.au.dk/~jg/ACNS05VoteProofFull.pdf.
15. P. Paillier, "Public-key cryptosystems based on composite degree residuosity class," in Proceedings of Advances in Cryptology -EUROCRYPT, LNCS 1592, 1999, pp. 223-239.
16. T. P. Pedersen, "A threshold cryptosystem without a trusted third party," in Proceedings of Advances in Cryptology - EUROCRYPT, LNCS 547,1991, pp. 522-526.
17. P. A. Fouque, G. Poupard, and J. Stern, "Sharing decryption in the context of voting or lotteries," in Proceedings of the 4th International Conference on Financial Cryptography, LNCS 1962,2001, pp. 90-104.
18. E. Fujisaki and T. Okamoto, "Statistical zero knowledge protocols to prove modular polynomial relations," in Proceedings of Advances in Cryptology - CRYPTO, LNCS 1294,1997, pp. 16-30.
19. I. Damgard and E. Fujisaki, "A statistically-hiding integer commitment scheme based on groups with hidden order," in Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology - ASIACRYPT, LNCS 2501,2002, pp. 125-142.
20. n, in Proceedings of Theory of Cryptography Conference, LNCS 3378, 2005, pp. 50-65.
21. R. Cramer, I. Damgard, and B. Schoenmakers, "Proofs of partial knowledge and simplified design of witness hiding protocols," in Proceedings of Advances in Cryptology - CRYPTO, LNCS 839, 1994, pp. 174-187.
22. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," in Proceedings of Advances in Cryptology - CRYPTO, LNCS 263,1986, pp. 186-194.
23. M. Bellare and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," in Proceedings of ACM Conference on Computer and Communications Security, 1993, pp. 62-73.
24. M. Jakobsson, K. Sako, and R. Impagliazzo, "Designated-verifier proofs and their applications," in Proceedings of Advances in Cryptology -EUROCRYPT, LNCS 1070, 1996, pp. 143-154.
25. C. P. Schnorr, "Efficient signature generation for smart cards," Journal of Cryptology, Vol. 3, 1991, pp. 161-174.
26. U. Feige and A. Shamir, "Witness indistinguishable and witness hiding protocols," in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 416-426.
27. H. Lipmaa, N. Asokan, and V. Niemi, "Secure vickrey auctions without threshold trust," in Proceedings of Financial Cryptography, LNCS 2357, 2002, pp. 87-101.
28. I. Damgard, J. Groth, and G. Salomonsen, "The theory and implementation of an electronic voting system," D. Gritzalis, ed., Secure Electronic Voting, Kluwer Academic Publishers, 2003, pp. 77-100.