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


Kun Peng, Journal of Information Processing Systems Vol. 7, No. 3, pp. 549-560, Sep. 2011  

https://doi.org/10.3745/JIPS.2011.7.3.549
Keywords: Efficient Proof, E-Voting
Fulltext:

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.


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Peng, K. (2011). Efficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting. Journal of Information Processing Systems, 7(3), 549-560. DOI: 10.3745/JIPS.2011.7.3.549.

[IEEE Style]
K. Peng, "Efficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting," Journal of Information Processing Systems, vol. 7, no. 3, pp. 549-560, 2011. DOI: 10.3745/JIPS.2011.7.3.549.

[ACM Style]
Kun Peng. 2011. Efficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting. Journal of Information Processing Systems, 7, 3, (2011), 549-560. DOI: 10.3745/JIPS.2011.7.3.549.