Secure voting using partially compatible homomorphisms

Kazue Sako, Joe Kilian

研究成果: Conference contribution

84 被引用数 (Scopus)


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.

ホスト出版物のタイトルAdvances in Cryptology — CRYPTO 1994 - 14th Annual International Cryptology Conference, Proceedings
編集者Yvo G. Desmedt
出版社Springer Verlag
出版ステータスPublished - 1994
イベント14th Annual International Cryptology Conference, CRYPTO 1994 - Santa Barbara , United States
継続期間: 1994 8 211994 8 25


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
839 LNCS


Conference14th Annual International Cryptology Conference, CRYPTO 1994
CountryUnited States
CitySanta Barbara

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Secure voting using partially compatible homomorphisms」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。