Multi-authority secret-ballot elections with linear work

  • Authors:
  • Ronald Cramer;Matthew Franklin;Berry Schoenmakers;Moti Yung

  • Affiliations:
  • CWI, Amsterdam, The Netherlands;AT&T Bell Labs., Murray Hill, NJ;DigiCash bv, Amsterdam, The Netherlands;IBM T.J. Watson Research Center, Yorktown Heights, NY

  • Venue:
  • EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present new cryptographic protocols for multiauthority 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 quadratic in previous schemes). Thus we get significantly closer to a practical election scheme.