Multi-authority secret-ballot elections with linear work
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, Damgaard 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.
|Department of Computer Science [CS]|
Cramer, R.J.F, Franklin, M, Schoenmakers, L.A.M, & Yung, M. (1995). Multi-authority secret-ballot elections with linear work. Department of Computer Science [CS]. CWI.