Remarks on mix-network based on permutation networks

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

Volumn 1992, Issue , 2001, Pages 317-324

  Abe, Masayuki ^a   Hoshino, Fumitaka ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; COMPUTATION THEORY;

EFFICIENT COMPUTATION; MIX NETWORKS; MIX-NET; PERMUTATION NETWORK;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937409147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44586-2_23     Document Type: Conference Paper

References (20)

1. M. Abe. Mix-networks on permutation networks. In K. Lam, E. Okamoto, and C. Xing, editors, Advances in Cryptology - Asiacrypt’99, volume 1716 of Lecture Notes in Computer Science, pages 258-273. Springer-Verlag, 1999.
2. M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. IEICE Transaction of Fundamentals of electronic Communications and Computer Science, E83-A(7):1431-1440, July 2000. Presented at Eurocrypt’98.
3. D. L. Chaum. Untraceable electronic mail, return address, and digital pseudonyms. Communications of the ACM, 24:84-88, 1981.
4. D. L. Chaum and T. P. Pedersen. Wallet databases with observers. In E. F. Brickell, editor, Advances in Cryptology — CRYPTO’92, volume 740 of Lecture Notes in Computer Science, pages 89-105. Springer-Verlag, 1993.
5. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Advances in Cryptology — CRYPTO’94, volume 839 of Lecture Notes in Computer Science, pages 174-187. Springer-Verlag, 1994.
6. Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. In B. Preneel, editor, Advances in Cryptology — EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 557-572. Springer-Verlag, 2000.
7. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In J. Stern, editor, Advances in Cryptology — EUROCRYPT’99, volume 1592 of Lecture Notes in Computer Science, pages 295-310. Springer-Verlag, 1999.
8. M. Jakobsson. A practical mix. In K. Nyberg, editor, Advances in Cryptology — EUROCRYPT’98, volume 1403 of Lecture Notes in Computer Science, pages 448-461. Springer-Verlag, 1998.
9. M. Jakobsson. Flash mixing. In PODC99, pages 83-89, 1999.
10. A. Juels and M. Jakobsson. Millimix. Technical Report 99-33, DIMACS Technical Report, June 1999.
11. M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In K. Kim and T. Matsumoto, editors, Advances in Cryptology — ASIACRYPT’96, volume 1163 of Lecture Notes in Computer Science, pages 125-132. Springer-Verlag, 1996.
12. M. Mitomo and K. Kurosawa. Attack for flash MIX. In Asiacrypt 2000 (to appear), 2000.
13. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS98, volume 1334 of Lecture Notes in Computer Science, pages 440-444. Springer-Verlag, 1998.
14. M. Ohkubo and M. Abe. A length-invariant hybrid mix. In Asiacrypt2000 (to appear), 2000.
15. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In T. Helleseth, editor, Advances in Cryptology — EUROCRYPT’93, volume 765 of Lecture Notes in Computer Science, pages 248-259. Springer-Verlag, 1994.
16. B. Pfitzmann. Breaking an efficient anonymous channel. In A. D. Santis, editor, Advances in Cryptology — EUROCRYPT’94, volume 950 of Lecture Notes in Computer Science, pages 339-348. Springer-Verlag, 1995.
17. B. Pfitzmann and A. Pfitzmann. How to break the direct RSA implementation of MIXes. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology - Eurocrypt’89, volume 434 of Lecture Notes in Computer Science, pages 373-381. Springer-Verlag, 1989.
18. K. Sako. An improved universally verifiable mix-type voting schemes. Unpublished Manuscript, 1995.
19. K. Sako and J. Kilian. Receipt-free mix-type voting scheme — a practical solution to the implementation of a voting booth —. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology — EUROCRYPT’95, volume 921 of Lecture Notes in Computer Science, pages 393-403. Springer-Verlag, 1995.
20. A. Waksman. A permutation network. Journal of the Association for Computing Machinery, 15(1):159-163, January 1968.