{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:30Z","timestamp":1725486090527},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414049"},{"type":"electronic","value":"9783540444480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44448-3_14","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:22:44Z","timestamp":1181362964000},"page":"178-191","source":"Crossref","is-referenced-by-count":34,"title":["A Length-Invariant Hybrid Mix"],"prefix":"10.1007","author":[{"given":"Miyako","family":"Ohkubo","sequence":"first","affiliation":[]},{"given":"Masayuki","family":"Abe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,10,27]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Asiacrypt\u2019 99","author":"M. Abe","year":"1999","unstructured":"M. Abe. Mix-networks on permutation networks. Asiacrypt\u2019 99, LNCS 1716, pages 258\u2013273. 1999."},{"key":"14_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-48405-1_9","volume-title":"Cryptology-CRYPTO\u2019 99","author":"M. Abe","year":"1999","unstructured":"M. Abe. Robust distributed multiplication without interaction. In M. Wiener, ed., in Cryptology-CRYPTO\u2019 99, LNCS 1666, pages 130\u2013147. 1999."},{"issue":"7","key":"14_CR3","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 Trans. Fundamentals, E83-A(7):1431\u20131440, July 2000. Presented in Eurocrypt\u201998.","journal-title":"IEICE Trans. Fundamentals"},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"CRYPTO\u2019 98","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. CRYPTO\u2019 98, LNCS 1462, pages 26\u201345. 1998."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. ACM CCCS, pages 62\u201373. 1993.","DOI":"10.1145\/168588.168596"},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"Eurocrypt\u2019 99","author":"R. Canetti","year":"1999","unstructured":"R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. Eurocrypt\u2019 99, LNCS 1592, pages 90\u2013106. 1999."},{"key":"14_CR7","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. Comm. of the ACM, 24:84\u201388, 1981.","journal-title":"Comm. of the ACM"},{"key":"14_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. CRYPTO\u2019 98, LNCS 1462, pages 13\u201325. 1998."},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Eurocrypt 2000","author":"Y. Desmedt","year":"2000","unstructured":"Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. Eurocrypt 2000, LNCS 1807, pages 557\u2013572. 2000."},{"key":"14_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"CRYPTO\u2019 99","author":"E. Fujisaki","year":"1999","unstructured":"E. Fujisaki and T. Okamoto. Secure integration of asymmetric and symmetric encryption schemes. CRYPTO\u2019 99, LNCS 1666, pages 537\u2013554. 1999."},{"key":"14_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-49162-7_22","volume-title":"PKC\u2019 99","author":"H. Handschuh","year":"1999","unstructured":"H. Handschuh, Y. Tsiounis, and M. Yung. Decision oracles are equivalent to matching oracles. PKC\u2019 99, LNCS 1560, pages 276\u2013289. 1999."},{"key":"14_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Eurocrypt\u2019 98","author":"M. Jakobsson","year":"1998","unstructured":"M. Jakobsson. A practical mix. Eurocrypt\u2019 98, LNCS 1403, pages 448\u2013461. 1998."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"M. Jakobsson. Flash mixing. PODC99, 1999.","DOI":"10.1145\/301308.301333"},{"key":"14_CR14","unstructured":"A. Juels and M. Jakobsson. Millimix. Tech. Report 99-33, DIMACS, June 1999."},{"key":"14_CR15","unstructured":"A. Menezes, P. Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997."},{"key":"14_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0034841","volume-title":"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. Asiacrypt\u2019 96, LNCS 1163, pages 125\u2013132. 1996."},{"key":"14_CR17","series-title":"Lect Notes Comput Sci","first-page":"440","volume-title":"ICICS\u2019 98","author":"W. Ogata","year":"1998","unstructured":"W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. ICICS\u2019 98, LNCS 1334, pages 440\u2013444. 1998."},{"key":"14_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Eurocrypt\u2019 93","author":"C. Park","year":"1994","unstructured":"C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all\/nothing election scheme. Eurocrypt\u2019 93, LNCS 765, pages 248\u2013259. 1994."},{"key":"14_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BFb0053448","volume-title":"Eurocrypt\u2019 94","author":"B. Pfitzmann","year":"1995","unstructured":"B. Pfitzmann. Breaking an efficient anonymous channel. Eurocrypt\u2019 94, LNCS 950, pages 339\u2013348. 1995."},{"key":"14_CR20","series-title":"Lect Notes Comput Sci","first-page":"373","volume-title":"Eurocrypt\u2019 89","author":"B. Pfitzmann","year":"1989","unstructured":"B. Pfitzmann and A. Pfitzmann. How to break the direct RSA implementation of MIXes. Eurocrypt\u2019 89, LNCS 434, pages 373\u2013381. 1989."},{"key":"14_CR21","unstructured":"T. Saitoh. The efficient reductions between the decision Diffie-Hellman problem and related problems. In the joint meeting of SCI2000 and ISAS2000, July 2000. available from the author."},{"key":"14_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"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-. Eurocrypt\u2019 95, LNCS 921, pages 393\u2013403. 1995."},{"key":"14_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45539-6_19","volume-title":"Eurocrypt 2000","author":"V. Shoup","year":"2000","unstructured":"V. Shoup. Using hash functions as a hedge against chosen ciphertext attack. Eurocrypt 2000, LNCS 1807, pages 275\u2013288. 2000."},{"key":"14_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054113","volume-title":"Eurocrypt\u2019 98","author":"V. Shoup","year":"1998","unstructured":"V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. Eurocrypt\u2019 98, LNCS 1403, pages 1\u201316. 1998."},{"key":"14_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BFb0054019","volume-title":"PKC\u2019 98","author":"Y. Tsiounis","year":"1998","unstructured":"Y. Tsiounis and M. Yung. On the security of El Gamal based encryption. PKC\u2019 98, LNCS 1431, pages 117\u2013134. 1998."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44448-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T23:13:32Z","timestamp":1556493212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44448-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414049","9783540444480"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44448-3_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}