TY - GEN
T1 - Secure voting using partially compatible homomorphisms
AU - Sako, Kazue
AU - Kilian, Joe
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1994.
PY - 1994
Y1 - 1994
N2 - We introduce a new number-theoretic based protocol for secure electronic voting. Our scheme is much more communication efficient than previous schemes of its type, and has a much lower round complexity than is currently possible using the anonymous-channel/mixer techniques. Preprocessing allows for nearly all of the communication and computation to be performed before any voting takes place. Unlike the mixer-based protocols, anyone can verify that everyone’s vote has been properly counted. Also, our techniques allow for a wide variety of different schemes. Our protocols are based on families of homomorphic encryptions which have a partial compatibility property, generalizing a method of Benaloh and Yung [2]. We use these functions to generate very simple interactive proofs on encrypted shares. We also develop amortization techniques yielding dramatic efficiency improvements over our simple protocols. Our protocols can be realized by current-generation PC’s with access to an electronic bulletin board.
AB - We introduce a new number-theoretic based protocol for secure electronic voting. Our scheme is much more communication efficient than previous schemes of its type, and has a much lower round complexity than is currently possible using the anonymous-channel/mixer techniques. Preprocessing allows for nearly all of the communication and computation to be performed before any voting takes place. Unlike the mixer-based protocols, anyone can verify that everyone’s vote has been properly counted. Also, our techniques allow for a wide variety of different schemes. Our protocols are based on families of homomorphic encryptions which have a partial compatibility property, generalizing a method of Benaloh and Yung [2]. We use these functions to generate very simple interactive proofs on encrypted shares. We also develop amortization techniques yielding dramatic efficiency improvements over our simple protocols. Our protocols can be realized by current-generation PC’s with access to an electronic bulletin board.
UR - http://www.scopus.com/inward/record.url?scp=84955615815&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84955615815&partnerID=8YFLogxK
U2 - 10.1007/3-540-48658-5_37
DO - 10.1007/3-540-48658-5_37
M3 - Conference contribution
AN - SCOPUS:84955615815
SN - 9783540583332
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 411
EP - 424
BT - Advances in Cryptology — CRYPTO 1994 - 14th Annual International Cryptology Conference, Proceedings
A2 - Desmedt, Yvo G.
PB - Springer Verlag
T2 - 14th Annual International Cryptology Conference, CRYPTO 1994
Y2 - 21 August 1994 through 25 August 1994
ER -