{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T11:30:53Z","timestamp":1792409453898,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540416586","type":"print"},{"value":"9783540445869","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44586-2_23","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T02:53:49Z","timestamp":1191725629000},"page":"317-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["Remarks on Mix-Network Based on Permutation Networks"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Abe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fumitaka","family":"Hoshino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,6,5]]},"reference":[{"key":"23_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology-Asiacrypt\u2019 99","author":"M. Abe","year":"1999","unstructured":"M. Abe. Mix-networks on permutation networks. In K. Lam, E. Okamoto, and C. Xing, editors, Advances in Cryptology-Asiacrypt\u2019 99, volume 1716 of Lecture Notes in Computer Science, pages 258\u2013273. Springer-Verlag, 1999."},{"issue":"7","key":"23_CR2","first-page":"1431","volume":"E83-A","author":"M. Abe","year":"2000","unstructured":"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\u20131440, July 2000. Presented at Eurocrypt\u201998.","journal-title":"IEICE Transaction of Fundamentals of electronic Communications and Computer Science"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. L. Chaum","year":"1981","unstructured":"D. L. Chaum. Untraceable electronic mail, return address, and digital pseudonyms. Communications of the ACM, 24:84\u201388, 1981.","journal-title":"Communications of the ACM"},{"key":"23_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology-CRYPTO\u2019 92","author":"D. L. Chaum","year":"1993","unstructured":"D. L. Chaum and T. P. Pedersen. Wallet databases with observers. In E. F. Brickell, editor, Advances in Cryptology-CRYPTO\u2019 92, volume 740of Lecture Notes in Computer Science, pages 89\u2013105. Springer-Verlag, 1993."},{"key":"23_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology-CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u2222rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Advances in Cryptology-CRYPTO\u2019 94, volume 839 of Lecture Notes in Computer Science, pages 174\u2013187. Springer-Verlag, 1994."},{"key":"23_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Advances in Cryptology-EUROCRYPT 2000","author":"Y. Desmedt","year":"2000","unstructured":"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 1807of Lecture Notes in Computer Science, pages 557\u2013572. Springer-Verlag, 2000."},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"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\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 295\u2013310. Springer-Verlag, 1999."},{"key":"23_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 98","author":"M. Jakobsson","year":"1998","unstructured":"M. Jakobsson. A practical mix. In K. Nyberg, editor, Advances in Cryptology-EUROCRYPT\u2019 98, volume 1403 of Lecture Notes in Computer Science, pages 448\u2013461. Springer-Verlag, 1998."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"M. Jakobsson. Flash mixing. In PODC99, pages 83\u201389, 1999.","DOI":"10.1145\/301308.301333"},{"key":"23_CR10","unstructured":"A. Juels and M. Jakobsson. Millimix. Technical Report 99-33, DIMACS Technical Report, June 1999."},{"key":"23_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BFb0034841","volume-title":"Advances in Cryptology-ASIACRYPT\u2019 96","author":"M. Michels","year":"1996","unstructured":"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\u2019 96, volume 1163 of Lecture Notes in Computer Science, pages 125\u2013132. Springer-Verlag, 1996."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"M. Mitomo and K. Kurosawa. Attack for flash MIX. In Asiacrypt 2000 (to appear), 2000.","DOI":"10.1007\/3-540-44448-3_15"},{"key":"23_CR13","series-title":"Lect Notes Comput Sci","first-page":"440","volume-title":"ICICS98","author":"W. Ogata","year":"1998","unstructured":"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\u2013444. Springer-Verlag, 1998."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"M. Ohkubo and M. Abe. A length-invariant hybrid mix. In Asiacrypt2000 (to appear), 2000.","DOI":"10.1007\/3-540-44448-3_14"},{"key":"23_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 93","author":"C. Park","year":"1994","unstructured":"C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all\/nothing election scheme. In T. Helleseth, editor, Advances in Cryptology-EUROCRYPT\u2019 93, volume 765 of Lecture Notes in Computer Science, pages 248\u2013259. Springer-Verlag, 1994."},{"key":"23_CR16","series-title":"Lect Notes Comput Sci","first-page":"339","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 94","author":"B. Pfitzmann","year":"1995","unstructured":"B. Pfitzmann. Breaking an efficient anonymous channel. In A. D. Santis, editor, Advances in Cryptology-EUROCRYPT\u2019 94, volume 950 of Lecture Notes in Computer Science, pages 339\u2013348. Springer-Verlag, 1995."},{"key":"23_CR17","series-title":"Lect Notes Comput Sci","first-page":"373","volume-title":"Advances in Cryptology-Eurocrypt\u2019 89","author":"B. Pfitzmann","year":"1989","unstructured":"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\u2019 89, volume 434 of Lecture Notes in Computer Science, pages 373\u2013381. Springer-Verlag, 1989."},{"key":"23_CR18","unstructured":"K. Sako. An improved universally verifiable mix-type voting schemes. Unpublished Manuscript, 1995."},{"key":"23_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 95","author":"K. Sako","year":"1995","unstructured":"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\u2019 95, volume 921 of Lecture Notes in Computer Science, pages 393\u2013403. Springer-Verlag, 1995."},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"A. Waksman. A permutation network. Journal of the Association for Computing Machinery, 15(1):159\u2013163, January 1968.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44586-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T16:05:23Z","timestamp":1596902723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44586-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416586","9783540445869"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44586-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"5 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}