International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 1996: Advances in Cryptology — EUROCRYPT ’96 pp 72-83

Multi-Authority Secret-Ballot Elections with Linear Work

  • Ronald Cramer
  • Matthew Franklin
  • Berry Schoenmakers
  • Moti Yung
Conference paper

DOI: 10.1007/3-540-68339-9_7

Volume 1070 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Cramer R., Franklin M., Schoenmakers B., Yung M. (1996) Multi-Authority Secret-Ballot Elections with Linear Work. In: Maurer U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg

Abstract

We present new cryptographic protocols for multi-authority secret ballot elections that guarantee privacy, robustness, and univer- sal 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 (com- pared to quadratic in previous schemes). Thus we get significantly closer to a practical election scheme.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Ronald Cramer
    • 1
  • Matthew Franklin
    • 2
  • Berry Schoenmakers
    • 3
  • Moti Yung
    • 4
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.AT&T Bell Labs.Murray HillUSA
  3. 3.DigiCash bvAmsterdamThe Netherlands
  4. 4.IBM T.J. Watson Research CenterYorktown HeightsUSA