Browse > Article
http://dx.doi.org/10.3745/JIPS.2011.7.3.549

Efficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting  

Peng, Kun (Institute for Inforcomm Research)
Publication Information
Journal of Information Processing Systems / v.7, no.3, 2011 , pp. 549-560 More about this Journal
Abstract
Vote validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e-voting. The existing vote validity proof technique is inefficient and only achieves honest-verifier zero knowledge. In this paper, an efficient proof and verification technique is proposed to guarantee vote validity in homomorphic e-voting. The new proof technique is mainly based on hash function operations that only need a very small number of costly public key cryptographic operations. It can handle untrusted verifiers and achieve stronger zero knowledge privacy. As a result, the efficiency and privacy of homomorphic e-voting applications will be significantly improved.
Keywords
Efficient Proof; E-Voting;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Jonathan Katz and Steven Myers and Rafail Ostrovsky. "Cryptographic Counters and Applications to Electronic Voting". Advances in Cryptology-EUROCRYPT 01, 2001, pp.78-92.
2 Aggelos Kiayias and Moti Yung. "Self-tallying Elections and Perfect Ballot Secrecy". Public Key Cryptography, 5th International Workshop-PKC 02, 2002, pp.141-158.
3 Byoungcheon Lee and Kwangjo Kim. "Receipt-free Electronic Voting Scheme with a Tamper-Resistant Randomizer". Information Security and Cryptology, ICISC 2002 in Lecture Notes in Computer Science, 2002. Springer-Verlag, pp.389-406.
4 Byoungcheon Lee and Kwangjo Kim. "Receipt-Free Electronic Voting Through Collaboration of Voter and Honest Verifier". JW-ISC 2000, 2000, pp.101-108.
5 C. Andrew Neff. "Conducting a Universally Verifiable Electronic Election Using Homomorphic Encryption".White Paper, VoteHere Inc, 2000.
6 K Peng and F Bao. "Efficient multiplicative homomorphic e-voting". ISC '10 in Lecture Notes in Computer Science, 2010, pp.381-393.
7 K Peng and F Bao. "Efficient Proof Of Validity Of Votes In Homomorphic E-Voting". NSS (International Conference on Network and System Security) '10, 2010, pp.17-23.
8 Kun Peng and Feng Bao. "Efficient Vote Validity Check in Homomorphic Electronic Voting". ICISC 2008 in Lecture Notes in Computer Science, 2008, pp.202-217.
9 Kun Peng and Colin Boyd and Ed Dawson and Byoungcheon Lee. "Multiplicative Homomorphic EVoting". INDOCRYPT 2004 in Lecture Notes in Computer Science, Berlin, 2004. Springer-Verlag, pp.61-72.
10 Berry Schoenmakers. "Fully Auditable Electronic Secret-Ballot Elections". XOOTIC Magazine, 2000.
11 Olivier Baudron and Pierre-Alain Fouque and David Pointcheval and Jacques Stern and Guillaume Poupard. "Practical multi-candidate election system". Twentieth Annual ACM Symposium on "Principles of Distributed Computing", 2001, pp.274-283.
12 D Boneh and X Boyen. "Short signatures without random oracles". Eurocrypt '04 in Lecture Notes in Computer Science, pp.56-73.
13 P Fouque and G Poupard and J Stern. "Sharing Decryption in the Context of Voting or Lotteries". Financial Cryptography 2000, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science, pp.90-104.
14 R Cramer and I Damgard and B Schoenmakers. "Proofs of partial knowledge and simplified design of witness hiding protocols". CRYPTO '94 in Lecture Notes in Computer Science, Berlin, 1994. Springer-Verlag, pp.174-187.
15 Ivan Damgaard and Mats Jurik. "A Generalisation", A Simplification and Some Applications of Paillier's Probabilistic Public-Key System. Public Key Cryptography-PKC 01, 2001, pp.119-136.
16 I Damgard. "Efficient Concurrent Zero-knowledge in the Auxiliary String Model". EUROCRYPT '00 in Lecture Notes in Computer Science, 2000, pp.431-444.
17 Pierre-Alain Fouque and Guillaume Poupard and Jacques Stern. "Sharing Decryption in the Context of Voting or Lotteries". Financial Cryptography 2000, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science, pp.90-104.
18 J Groth. "Non-interactive Zero-Knowledge Arguments for Voting". ACNS '05, Berlin, 2005. Springer-Verlag. Lecture Notes in Computer Science, pp.467-482.
19 Guillou, L. C. and Quisquater, J. J. "A paradoxical'' identity-based signature scheme resulting from zero-knowledge". In Shafi Goldwasser, editors, CRYPTO '88 in Lecture Notes in Computer Science, Berlin, 1989. Springer-Verlag, pp.216-231.
20 Martin Hirt and Kazue Sako. "Efficient Receipt-Free Voting Based on Homomorphic Encryption". Advances in Cryptology-EUROCRYPT 00, 2000, pp.539-556.
21 James M. Adler and Wei Dai and Richard L. Green and C. Andrew Neff. "Computational Details of the VoteHere Homomorphic Election System". Technical Report, VoteHere Inc, 2000. Available from http://www.votehere.net/technicaldocs/hom.pdf, last accessed 22 June, 2002.