Efficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (21)
- "Computational Details of the VoteHere Homomorphic Election System, Technical Report" (2000)[URL]
- Olivier Baudron, "Practical multi-candidate election system", Twentieth Annual ACM Symposium on “Principles of Distributed Computing, pp.274~283 (2001)
- D Boneh, "Short signatures without random oracles", Eurocrypt '04 in Lecture Notes in Computer Science, pp.56~73 (2004)
- R Cramer, "Proofs of partial knowledge and simplified design of witness hiding protocols", CRYPTO '94 in Lecture Notes in Computer Science, Berlin, pp.174~187 (1994), Springer-Verlag
- Ivan Damgaård, "A Generalisation, A Simplification and Some Applications of Paillier's Probabilistic Public-Key System", Public Key Cryptography-PKC 01, pp.119~136 (2001)
- I Damgård, "Efficient Concurrent Zero-knowledge in the Auxiliary String Model", EUROCRYPT '00 in Lecture Notes in Computer Science, pp.431~444 (2000)
- P Fouque, "Sharing Decryption in the Context of Voting or Lotteries", Financial Cryptography 2000, Lecture Notes in Computer Science, pp.90~104 (2000), Springer-Verlag
- Pierre-Alain Fouque, "Sharing Decryption in the Context of Voting or Lotteries", Financial Cryptography 2000, Berlin, 2000, Lecture Notes in Computer Science, pp.90~104 (2000), Springer-Verlag
- J Groth, "Non-interactive Zero-Knowledge Arguments for Voting", ACNS '05, Berlin, 2005. Lecture Notes in Computer Science, pp.467~482 (2005), Springer-Verlag
- Guillou, L. C, "A paradoxical'' identity-based signature scheme resulting from zero-knowledge", CRYPTO '88 in Lecture Notes in Computer Science, Berlin, pp.216~231 (1989), Springer-Verlag
- Martin Hirt, "Efficient Receipt-Free Voting Based on Homomorphic Encryption", Advances in Cryptology-EUROCRYPT 00, pp.539~556 (2000)
- Jonathan Katz, "Cryptographic Counters and Applications to Electronic Voting", Advances in Cryptology-EUROCRYPT 01, pp.78~92 (2001)
- Aggelos Kiayias, "Self-tallying Elections and Perfect Ballot Secrecy. Public Key Cryptography", 5th International Workshop-PKC 02, pp.141~158 (2002)
- Byoungcheon Lee, "Receipt-free Electronic Voting Scheme with a Tamper- Resistant Randomizer", Information Security and Cryptology, ICISC 2002 in Lecture Notes in Computer Science, pp.389~406 (2002), Springer-Verlag
- 이병천, "Receipt-free Electronic Voting Through Collaboration of Voter and Honest Verifier", pp.101~108 (2000)
- Conducting a Universally Verifiable Electronic Election Using Homomorphic Encryption, "C. Andrew Neff", VoteHere Inc, ~ (2000)
- K Peng, "Efficient multiplicative homomorphic e-voting", ISC '10 in Lecture Notes in Computer Science, pp.381~393 (2010)
- K Peng, "Efficient Proof Of Validity Of Votes In Homomorphic E-Voting", NSS (International Conference on Network and System Security) '10, pp.17~23 (2010)
- Kun Peng, "Efficient Vote Validity Check in Homomorphic Electronic Voting", ICISC 2008 in Lecture Notes in Computer Science, pp.202~217 (2008)
- Kun Peng, "Multiplicative Homomorphic EVoting", INDOCRYPT 2004 in Lecture Notes in Computer Science, Berlin, pp.61~72 (2004), Springer-Verlag
- Berry Schoenmakers, "Fully Auditable Electronic Secret-Ballot Elections", XOOTIC Magazine (2000)