{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:41:01Z","timestamp":1762004461813},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642349607"},{"type":"electronic","value":"9783642349614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34961-4_37","type":"book-chapter","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T09:22:26Z","timestamp":1353057746000},"page":"607-625","source":"Crossref","is-referenced-by-count":16,"title":["A Mix-Net from Any CCA2 Secure Cryptosystem"],"prefix":"10.1007","author":[{"given":"Shahram","family":"Khazaei","sequence":"first","affiliation":[]},{"given":"Tal","family":"Moran","sequence":"additional","affiliation":[]},{"given":"Douglas","family":"Wikstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","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":"Desmedt, Y., Kurosawa, K.: How to Break a Practical MIX and Design a New One. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 557\u2013572. Springer, Heidelberg (2000)"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J. Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An Efficient Scheme for Proving a Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"issue":"1","key":"37_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1093\/ietfec\/e90-a.1.113","volume":"90-A","author":"J. Furukawa","year":"2007","unstructured":"Furukawa, J., Sako, K.: An efficient publicly verifiable mix-net for long inputs. IEICE Transactions\u00a090-A(1), 113\u2013127 (2007)","journal-title":"IEICE Transactions"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-63594-7_64","volume-title":"Financial Cryptography","author":"E. Gabber","year":"1997","unstructured":"Gabber, E., Gibbons, P.B., Matias, Y., Mayer, A.: How to Make Personalized Web Browising Simple, Secure, and Anonymous. In: Hirschfeld, R. (ed.) FC 1997. LNCS, vol.\u00a01318, pp. 17\u201332. Springer, Heidelberg (1997)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36178-2_28","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"P. Golle","year":"2002","unstructured":"Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic Mixing for Exit-Polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 451\u2013465. Springer, Heidelberg (2002)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Jakobsson","year":"1998","unstructured":"Jakobsson, M.: A Practical Mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 448\u2013461. Springer, Heidelberg (1998)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Jakobsson, M.: Flash mixing. In: PODC, pp. 83\u201389 (1999)","DOI":"10.1145\/301308.301333"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: Mix and match: Secure function evaluation via ciphertexts. In: Okamoto [18], pp. 162\u2013177","DOI":"10.1007\/3-540-44448-3_13"},{"key":"37_CR11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/383962.384046","volume-title":"PODC","author":"M. Jakobsson","year":"2001","unstructured":"Jakobsson, M., Juels, A.: An optimally robust hybrid mix network. In: PODC, pp. 284\u2013292. ACM Press, New York (2001)"},{"key":"37_CR12","unstructured":"Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomized partial checking. In: Boneh, D. (ed.) USENIX Security Symposium, pp. 339\u2013353. USENIX (2002)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-48892-8_13","volume-title":"Selected Areas in Cryptography","author":"M. Jakobsson","year":"1999","unstructured":"Jakobsson, M., M\u2019Ra\u00efhi, D.: Mix-Based Electronic Payments. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 157\u2013173. Springer, Heidelberg (1999)"},{"key":"37_CR14","unstructured":"Khazaei, S., Wikstr\u00f6m, D.: Randomized partial checking revisited. Cryptology ePrint Archive. Report 2012\/063 (2012), http:\/\/eprint.iacr.org\/2012\/063"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Mitomo, M., Kurosawa, K.: Attack for flash mix. In: Okamoto [18], pp. 192\u2013204","DOI":"10.1007\/3-540-44448-3_15"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/501983.502000","volume-title":"CCS 2001: Proc. of the 8th ACM Conference on Computer and Communications Security","author":"C.A. Neff","year":"2001","unstructured":"Neff, C.A.: A verifiable secret shuffle and its application to e-voting. In: CCS 2001: Proc. of the 8th ACM Conference on Computer and Communications Security, pp. 116\u2013125. ACM, New York (2001)"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Ohkubo, M., Abe, M.: A length-invariant hybrid mix. In: Okamoto [18], pp. 178\u2013191","DOI":"10.1007\/3-540-44448-3_14"},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT 2000","year":"2000","unstructured":"Okamoto, T. (ed.): ASIACRYPT 2000. LNCS, vol.\u00a01976. Springer, Heidelberg (2000)"},{"key":"37_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient Anonymous Channel and All\/Nothing Election Scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 248\u2013259. Springer, Heidelberg (1994)"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0053448","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"B. Pfitzmann","year":"1995","unstructured":"Pfitzmann, B.: Breaking an Efficient Anonymous Channel. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 332\u2013340. Springer, Heidelberg (1995)"},{"key":"37_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-46885-4_37","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"B. Pfitzmann","year":"1990","unstructured":"Pfitzmann, B., Pfitzmann, A.: How to Break the Direct RSA-Implementation of MIXes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 373\u2013381. Springer, Heidelberg (1990)"},{"key":"37_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"K. Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-Free Mix-Type Voting Scheme \u2014 A Practical Solution to the Implementation of a Voting Booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"key":"37_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-24654-1_12","volume-title":"Selected Areas in Cryptography","author":"D. Wikstr\u00f6m","year":"2004","unstructured":"Wikstr\u00f6m, D.: Five Practical Attacks for \u201cOptimistic Mixing for Exit-Polls\u201d. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 160\u2013175. Springer, Heidelberg (2004)"},{"key":"37_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-24638-1_18","volume-title":"Theory of Cryptography","author":"D. Wikstr\u00f6m","year":"2004","unstructured":"Wikstr\u00f6m, D.: A Universally Composable Mix-Net. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 317\u2013335. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34961-4_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T20:34:43Z","timestamp":1687811683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34961-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642349607","9783642349614"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34961-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}