Abstract
This work elicits the fact that all current proposals for electronic voting schemes disclose the final tally of the votes. In certain situations, like jury voting, this may be undesirable. We present a robust and universally verifiable Membership Testing Scheme (MTS) that allows, among other things, a collection of voters to cast votes and determine whether their tally belongs to some pre-specified small set (e.g., exceeds a given threshold) — our scheme discloses no additional information than that implied from the knowledge of such membership. We discuss several extensions of our basic MTS. All the constructions presented combine features of two parallel lines of research concerning electronic voting schemes, those based on MIX-networks and in homomorphic encryption.
Partially supported by Conicyt via Fondap in Applied Mathematics 1999-2000, and Fondecyt No. 1981182, and by NSF CCR-0093029.
Gratefully acknowledges the support of Conicyt via Fondecyt No. 1981182 and Fondap in Applied Mathematics 1999-2000.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abe. Universally verifiable MIX-net with verification work independent of the number of MIX-servers. Proc. of EuroCrypt’98, 437–447. Springer-Verlag. LNCS Vol. 1403.
M. Abe. Mix-Networks on Permutation Networks. Proc. of Asiacrypt’99, 258–273. Springer-Verlag. LNCS Vol. 1716.
J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Dept. of Computer Science, Sep. 1987.
M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proc. of STOC’88, 1–10, ACM.
C. Boyd. A new multiple key cipher and an improved voting scheme. Proc. of EuroCrypt’89, 617–625. Springer-Verlag. LNCS Vol. 434.
F. Boudot, B. Schoenmakers and J. Traore. A fair and efficient solution to the socialist millionaires’ problem. Discrete Applied Mathematics, 111(1–2):23–36, 2001.
J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. Proc. of STOC’94, 544–553, ACM.
J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. Proc. of PODC’86, 52–62. ACM.
D. Chaum, C. Crépeau and I. B. Damgård. Multiparty unconditionally secure protocols. Proc. of Crypto’87, 462–462. Springer-Verlag. LNCS Vol. 293.
R. Cramer, I. Damgård and B. Schoenmakers. Proofs of partial knowledge simplified design of witness. Proc. of Crypto’94, 174–187. Springer-Verlag. LNCS Vol. 839.
J. D. Cohen and M. J. Fischer. A robust and verifiable cryptographically secure election scheme. Proc. of FOCS’85, 372–382, IEEE.
R. Cramer, M. K. Franklin, B. Schoenmakers and M. Yung. Multiauthority secret-ballot elections with linear work. Proc. of EuroCrypt’96, 72–83. Springer-Verlag. LNCS Vol. 1070.
R. Cramer, R. Gennaro and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. Proc. of EuroCrypt’97, 103–118. Springer-Verlag. LNCS Vol. 1233.
R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. Proc. of EuroCrypt’ 99, 90–106. Springer-Verlag. LNCS Vol. 1592.
D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84–88, 1981. ACM.
D. Chaum. Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA. Proc. of EuroCrypt’88, 177–182. Springer-Verlag. LNCS Vol. 330.
D. Chaum and T. P. Pedersen. Wallet databases with observers. Proc. of Crypto’92, 89–105. Springer-Verlag. LNCS Vol. 740.
Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. Proc. of EuroCrypt’00, 557–572. Springer-Verlag. LNCS Vol. 1807.
T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions of Information Theory, IT-31(4):469–472, 1985.
J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. Proc. of Crypto’01, 368–387. Springer-Verlag. LNCS Vol. 2139.
R. Gennaro. Manuscript, 1995.
R. Gennaro. Achieving independence efficiently and securely. Proc. of PODC’95, 130–136, ACM.
R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key bgeneration for discrete-log based cryptosystems. Proc. of EuroCrypt’99, 295–310. Springer-Verlag. LNCS Vol. 1592.
O. Goldreich, S. Micali and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. Proc. of FOCS’86 174–187, IEEE.
A. Hevia and M. Kiwi. Electronic Jury Voting Protocols. Cryptology ePrint Archive, Report 2000/035, Jul. 2000.
M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. Proc. of EuroCrypt’00, 539–556. Springer-Verlag. LNCS Vol. 1807.
M. Jakobsson. A practical mix. Proc. of EuroCrypt’98, 448–461. Springer-Verlag. LNCS Vol. 1403.
M. Jakobsson and A. Juels. Millimix: Mixing in small batches. Technical Report 99-33, DIMACS, 1999.
M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. Proc. of Asiacrypt’00, 162–178. Springer-Verlag. LNCS Vol. 1976.
M. Mitomo and K. Kurosawa. Attack for flash MIX. Proc. of Asiacrypt’ 00, 192–204. Springer-Verlag. LNCS Vol. 1976.
C. A. Neff. A verifiable secret shuffle and its application to e-voting. Proc. of CCS’01. ACM.
M. Ohkubo and M. Abe. A length-invariant hybrid mix. Proc. of Asiacrypt’ 00, 178–191. Springer-Verlag. LNCS Vol. 1976.
T. P. Pedersen. Distributed provers with applications to undeniable signatures. In EuroCrypt’91, 221–242. Springer-Verlag. LNCS Vol. 547.
B. Pfitzmann. Breaking an efficient anonymous channel. Proc. of Euro-Crypt’94, 332–340. Springer-Verlag. LNCS Vol. 950.
C. Park, K. Itoh and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. Proc. of EuroCrypt’93, 248–259. Springer-Verlag. LNCS Vol. 765.
B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. Proc. of Crypto’99, 148–164. Springer-Verlag. LNCS Vol. 1666.
P. Syverson, D. Goldschlag and M. Reed. Anonymous connections and onion routing. Proc. of IEEE Symposium on Security and Privacy, 44–54, IEEE, 1997.
K. Sako and J. Kilian. Secure voting using partially compatible homomorphisms. Proc. of Crypto’94, 411–424. Springer-Verlag. LNCS Vol. 839.
K. Sako and J. Kilian. Receipt-free mix-type voting scheme-A practical solution to the implementation of a voting booth. Proc. of EuroCrypt’95, 393–403. Springer-Verlag. LNCS Vol. 921.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hevia, A., Kiwi, M. (2002). Electronic Jury Voting Protocols. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive