An Efficient E2E Verifiable E-voting System without Setup Assumptions
Aggelos Kiayias, Thomas Zacharias, Bingsheng Zhang · IEEE Security & Privacy · 2017
End-to-end (E2E) verifiability has been widely identified as a critical property for the adoption of e-voting systems in real world election procedures. In this work, we present a new e-voting system that is E2E verifiable without any additional “setup” assumption or access to a random oracle. Previously known E2E verifiable e-voting systems required such additional assumptions (specifically, either the existence of a “randomness beacon” or were only shown secure in the random oracle model). Furthermore, our scheme only employs conventional cryptographic building blocks, such as the ElGamal encryption, and it does not require any cryptographic functionality at the client-side to cast a vote. The E2E verifiability property of our scheme is guaranteed information theoretically given the existence of a consistent bulletin board, and the voter privacy is achieved under the well-known DDH assumption.