TY - GEN
T1 - Multi-authority secret-ballot elections with linear work
AU - Cramer, R.
AU - Franklin, M.K.
AU - Schoenmakers, B.
AU - Yung, M.
PY - 1996
Y1 - 1996
N2 - 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.
AB - 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.
U2 - 10.1007/3-540-68339-9_7
DO - 10.1007/3-540-68339-9_7
M3 - Conference contribution
SN - 3-540-61186-X
T3 - Lecture Notes in Computer Science
SP - 72
EP - 83
BT - Advances in Cryptology - EUROCRYPT'96 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996)
A2 - Maurer, U.M.
PB - Springer
CY - Berlin
ER -