Abstract
All the currently existing homomorphic e-voting schemes are based on additive homomorphism. In this paper a new e-voting scheme based on multiplicative homomorphism is proposed. In the tallying phase, a decryption is performed to recover the product of the votes, instead of the sum of them (as in the additive homomorphic e-voting schemes). Then, the product is factorized to recover the votes. The new e-voting scheme is more efficient than the additive homomorphic e-voting schemes and more efficient than other voting schemes when the number of candidates is small. Strong vote privacy and public verifiability are obtained in the new e-voting scheme. © Springer-Verlag 2004.
Cite
CITATION STYLE
Peng, K., Aditya, R., Boyd, C., Dawson, E., & Lee, B. (2004). Multiplicative homomorphic e-voting. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3348, 61–72. https://doi.org/10.1007/978-3-540-30556-9_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
