Universally verifiable mix-net with verification work independent of the number of mix-servers

  • Masayuki Abe
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1403)

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

Mix-net Electronic Voting Universal Verifiability 
Download to read the full conference paper text

References

  1. 1.
    R. Alton-Scheidl, R. Schmutzer, P.-P. Sint, and G. Tscherteu. Voting and rating. Technical report, Research Unit for Socio-Economics, 1997.Google Scholar
  2. 2.
    J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In 26th STOC, pages 544–553, 1994.Google Scholar
  3. 3.
    C. Boyd. Multisignatures based on zero knowledge schemes. Electronics Letters, 27(22):2002–2004, 1991.Google Scholar
  4. 4.
    S. Brands. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT'97, volume 1233 of LNCS, pages 318–333. Springer-Verlag, 1997.Google Scholar
  5. 5.
    D. Chaum. Untraceable electronic mail, return address, and digital pseudonyms. In Communications of the ACM, volume 24, pages 84–88, 1981.CrossRefGoogle Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    Markus Jakobsson. A practical mix. In EUROCRYPT '98, 1998.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS98, 1997. To appear.Google Scholar
  15. 15.
    K. Ohta and T. Okamoto. The exact security of multi-signature schemes. Technical Report ISEC97-27, IEICE, July 1997.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    B. Pfitzmann. Breaking an efficient anonymous channel. In EUROCRYPT '94, volume 950 of LNCS, pages 339–348. Springer-Verlag, 1995.Google Scholar
  18. 18.
    K. Sako. An improved universally verifiable mix-type voting schemes. Unpublished Manuscript, 1995.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239–252, 1991.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Masayuki Abe
    • 1
  1. 1.NTT Laboratories Nippon Telegraph and Telephone CorporationKanagawa-kenJapan

Personalised recommendations