Multi-Authority Secret-Ballot Elections with Linear Work [chapter]

Ronald Cramer, Matthew Franklin, Berry Schoenmakers, Moti Yung
1996 Lecture Notes in Computer Science  
We present new cryptographic protocols for multi-authority secret ballot elections that guarantee privacy, robustness, and universal verifiability. Application of some novel techniques, in particular the construction of witness hiding/indistinguishable protocols from Cramer, Damgård and Schoenmakers, and the verifiable secret sharing scheme of Pedersen, reduce the work required by the voter or an authority to a linear number of cryptographic operations in the population size (compared to
more » ... ic in previous schemes). Thus we get significantly closer to a practical election scheme.
doi:10.1007/3-540-68339-9_7 fatcat:bnzqh6ltkreubfgxutnrtj6r4q