Abstract
This paper discusses the implementation of the voting scheme based on mix-net technology. The advantages of employing this technology are that voters can vote-and-go, and that it is flexible enough to be used for variety of vote-expression methods, while ensuring the privacy of votes and the elimination of faulty players. The most attractive security feature of this scheme is its universal verifiability; anyone can confirm the correctness of the result.
Such verifiability is achieved by providing proofs on correct shuffling and decryption. The paper presents a new scheme for generating a single proof for shuffle-and-decrypt process. Compared to the combination of two separate proofe on shuffle and decryption, the new scheme is 150% faster with only 80% of the length. As a result, the system was able to produce results that were verified correct within twenty minutes following a vote participated in by ten thousand voters, with three shuffling centers being used.
We believe this is the first implementation report of a voting scheme with universal verifiability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Abe: “Mix-networks on permutation networks,” Advances in Cryptology — ASIACRYPT’ 99, pp. 258–273, Springer-Verlag, 1999.
S. Brands, An Efficient Off-line Electronic Cash System Based On The Representation Problem, CWI Technical Report CS-R9323, (1993)
D. Chaum: “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Communications of the ACM, pp. 84–88, ACM, 1981.
J. D. Cohen and M. Yung: “Distributing the power of a government to enhance the privacy of voters,” Annual Symposium on Principles of Distributed Computing, pp. 52–62, 1985.
R. Cramer, R. Gennaro, and B. Schoenmakers: “A secure and optimally efficient multi-authority election scheme,” European Transactions on Telecommunications, 8:481–489, 1997. Preliminary version in Advances in Cryptology — EUROCRYPT’ 97.
R. Cramer, M. Franklin, B. Schoenmakers and M. Yung: “Secure Secret Ballot Election Schemes with Linear Work,” in Advances in Cryptology — EUROCRYPT’ 96.
I. Damgård and M. Jurik: “A Generalization, a Simplification and some Applications of Paillier’s Probabilistic Public-Key system,” in Proc. of Public Key Cryptography 2001.
T. ElGamal: “A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithm,” IEEE Transactions on Information Theory, Vol. IT-31, pp. 469–472, 1985.
A. Fujioka, T. Okamoto, and K. Ohta: “A Practical Secret Voting Scheme for Large Scale Elections,” Advances in Cryptology–AUSCRYPT’ 92, pp. 244–251, Springer-Verlag, 1992.
A. Fiat and A. Shamir. “How to prove yourself: Practical solutions to identification and signature problems,” Advances in Cryptology — CRYPTO’ 86, volume 263 of Lecture Notes in Computer Science, pages 186–194, 1986.
J. Furukawa and K. Sako: “An Efficient Scheme for Proving an Shuffle” Advances in Cryptology — CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 368–387, 2001.
Menezes, van Oorschot, Vanstone: “Handbook of Applied Cryptography” CRC Press.
M. Michels and P. Horster: “Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme,” Advances in Cryptology —ASIACRYPT’ 96, pp. 125–132, Springer-Verlag, 1996.
C.A. Neff, “A Verifiable Secret Shuffle and its Application to E-Voting”, ACMCCS 01 pp. 116–125 2001.
M. Ookubo, F. Miura, M. Abe A. Fujioka and T. Okamoto: “An improvement of a practical secret voting scheme” Information Security Workshop 1999.
C. Park, K. Itoh, and K. Kurosawa: “Efficient Anonymous Channel and All/Nothing Election Scheme,” Advances in Cryptology — EUROCRYPT’ 93, pp. 248–259, Springer-Verlag, 1993.
K. Sako: “Electronic voting schemes allowing open objection to the tally,” Transactions of IEICE, vol. E77-A No.l, Jan. 1994.
K. Sako, J. Kilian: “Secure Voting using Partially Compatible Homomorphisms,” Advances in Cryptology — CRYPTO’ 94, pp. 411–424, Springer-Verlag, 1994.
K. Sako, J. Kilian: “Receipt-Free Mix-Type Voting Scheme,” Advances in Cryptology — EUROCRYPT’95, pp. 393–403, Springer-Verlag, 1995.
C. P. Schnorr: “Efficient signature generation by smart cards,” Journal of Cryptology, 4, pp. 161–174, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFCA/Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furukawa, J., Miyauchi, H., Mori, K., Obana, S., Sako, K. (2003). An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling. In: Blaze, M. (eds) Financial Cryptography. FC 2002. Lecture Notes in Computer Science, vol 2357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36504-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-36504-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00646-6
Online ISBN: 978-3-540-36504-4
eBook Packages: Springer Book Archive