Abstract
In this paper we construct a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant against the number of mix-servers except for some negligible tasks like addition. The scheme is robust, too.
Keywords
Download to read the full chapter text
Chapter PDF
References
R. Alton-Scheidl, R. Schmutzer, P.-P. Sint, and G. Tscherteu. Voting and rating. Technical report, Research Unit for Socio-Economics, 1997.
J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In 26th STOC, pages 544–553, 1994.
C. Boyd. Multisignatures based on zero knowledge schemes. Electronics Letters, 27(22):2002–2004, 1991.
S. Brands. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT'97, volume 1233 of LNCS, pages 318–333. Springer-Verlag, 1997.
D. Chaum. Untraceable electronic mail, return address, and digital pseudonyms. In Communications of the ACM, volume 24, pages 84–88, 1981.
D. Chaum. Elections with unconditionally-secret ballots and disruptions equivalent to breaking RSA. In EUROCRYPT '88, volume 330 of LNCS, pages 177–182. Springer-Verlag, 1988.
J. Cohen and M. Fischer. A robust and verifiable cryptographically secure election scheme. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 372–382. IEEE Computer Society, 1985.
R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secret-ballot elections with linear work. In EUROCRYPT '96, volume 1070 of LNCS, pages 72–83. Springer-Verlag, 1996.
R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In EUROCRYPT'97, volume 1233 of LNCS, pages 103–118. Springer-Verlag, 1997.
A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In AUSCRYPT'92, volume 718 of LNCS, pages 244–251. Springer-Verlag, 1993.
Markus Jakobsson. A practical mix. In EUROCRYPT '98, 1998.
M. Michels and P. Horster. On the risk of disruption in several multiparty signature schemes. In ASIACRYPT'96, volume 1163 of LNCS, pages 334–345. Springer-Verlag, 1996.
M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In ASIACRYPT'96, volume 1163 of LNCS, pages 125–132. Springer-Verlag, 1996.
W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS98, 1997. To appear.
K. Ohta and T. Okamoto. The exact security of multi-signature schemes. Technical Report ISEC97-27, IEICE, July 1997.
C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In EUROCRYPT '93, volume 765 of LNCS, pages 248–259. Springer-Verlag, 1994.
B. Pfitzmann. Breaking an efficient anonymous channel. In EUROCRYPT '94, volume 950 of LNCS, pages 339–348. Springer-Verlag, 1995.
K. Sako. An improved universally verifiable mix-type voting schemes. Unpublished Manuscript, 1995.
K. Sako and J. Kilian. Receipt-free mix-type voting scheme-a practical solution to the implementation of a voting booth-. In EUROCRYPT '95, volume 921 of LNCS, pages 393–403. Springer-Verlag, 1995.
C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239–252, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abe, M. (1998). Universally verifiable mix-net with verification work independent of the number of mix-servers. In: Nyberg, K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054144
Download citation
DOI: https://doi.org/10.1007/BFb0054144
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64518-4
Online ISBN: 978-3-540-69795-4
eBook Packages: Springer Book Archive