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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1403, Issue , 1998, Pages 437-447

  Abe, Masayuki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

Electronic voting; Mix net; Universal verifiability

Indexed keywords

CRYPTOGRAPHY;

COMPUTATIONAL TASK; ELECTRONIC VOTING; MIX SERVERS; MIX-NET; UNIVERSAL VERIFIABILITY;

COMPUTATION THEORY;

EID: 84957715741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054144     Document Type: Conference Paper

References (20)

1. R. Alton-Scheidl, R. Schmutzer, P.-P. Sint, and G. Tscherteu. Voting and rating. Technical report, Research Unit for Socio-Economics, 1997.
2. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In 26th STOC, pages 544-553, 1994.
3. C. Boyd. Multisignatures based on zero knowledge schemes. Electronics Letters, 27(22):2002-2004, 1991.
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.
5. D. Chaum. Untraceable electronic mail, return address, and digital pseudonyms. In Communications of the ACM, volume 24, pages 84-88, 1981.
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.
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.
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.
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.
10. A. Fujioka, T. Okamoto, and K. Ohta. A practiced secret voting scheme for large scale elections. In AUSCRYPT’92, volume 718 of LNCS, pages 244-251. Springer-Verlag, 1993.
11. Markus Jakobsson. A practical mix. In EUROCRYPT ’98, 1998.
12. M. Michels and P. Horster. On the risk of disruption in severed multiparty signature schemes. In ASIACRYPT’96, volume 1163 of LNCS, pages 334-345. Springer-Verlag, 1996.
13. M. Michels and P. Horster. Some remarks on a receipt-free eind universally verifiable mix-type voting scheme. In ASIACRYPT’96, volume 1163 of LNCS, pages 125-132. Springer-Verlag, 1996.
14. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault toleremt anonymous channel. In ICICS98, 1997. To appear.
15. K. Ohta and T. Okamoto. The exact security of multi-signature schemes. Technical Report ISEC97-27, IEICE, July 1997.
16. C. Peirk, 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.
17. B. Pfitzmann. Breaking an efficient anonymous cheinnel. In EUROCRYPT ’94, volume 950 of LNCS, pages 339-348. Springer-Verlag, 1995.
18. K. Seiko. An improved universally verifiable mix-type voting schemes. Unpublished Manuscript, 1995.
19. K. Seiko and J. Kiliem. 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.
20. C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.