{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T03:44:15Z","timestamp":1768016655709,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540706298","type":"print"},{"value":"9783540706304","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70630-4_7","type":"book-chapter","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T05:20:10Z","timestamp":1216704010000},"page":"99-114","source":"Crossref","is-referenced-by-count":8,"title":["Breaking and Provably Fixing Minx"],"prefix":"10.1007","author":[{"given":"Erik","family":"Shimshock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matt","family":"Staats","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Hopper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Random oracles are practical: a paradigm for designing efficient protocols","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. ACM Press, New York (1993)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the rsa encryption standard pkcs #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/11535218_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J. Camenisch","year":"2005","unstructured":"Camenisch, J., Lysyanskaya, A.: A Formal Treatment of Onion Routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 169\u2013187. Springer, Heidelberg (2005)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D.L. Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Danezis, G., Laurie, B.: Minx: a simple and efficient anonymous packet format. In: Proceedings of the 2004 ACM workshop on Privacy in the electronic society, pp. 59\u201365 (2004)","DOI":"10.1145\/1029179.1029198"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11836810_4","volume-title":"Information Security","author":"G. Danezis","year":"2006","unstructured":"Danezis, G.: Breaking four mix-related schemes based on universal re-encryption. In: Katsikas, S.K., L\u00f3pez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol.\u00a04176, pp. 46\u201359. Springer, Heidelberg (2006)"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/SECPRI.2003.1199323","volume-title":"SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy","author":"G. Danezis","year":"2003","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type iii anonymous remailer protocol. In: SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy, Washington, DC, USA, p. 2. IEEE Computer Society, Los Alamitos (2003)"},{"key":"7_CR8","unstructured":"Gligor, V., Donescu, P.: Infinite Garble Extension. Contribution to NIST (2000)"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"D. Goldschlag","year":"1999","unstructured":"Goldschlag, D., Reed, M., Syverson, P.: Onion routing. Commun. ACM\u00a042(2), 39\u201341 (1999)","journal-title":"Commun. ACM"},{"key":"7_CR10","first-page":"1999","volume":"1999","author":"S. Goldwasser","year":"1996","unstructured":"Goldwasser, S., Bellare, M.: Lecture notes on cryptography. Summer Course Cryptography and Computer Security at MIT\u00a01999, 1999 (1996)","journal-title":"Summer Course Cryptography and Computer Security at MIT"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-540-24660-2_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"P. Golle","year":"2004","unstructured":"Golle, P., Jakobsson, M., Juels, A., Syverson, P.F.: Universal re-encryption for mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 163\u2013178. Springer, Heidelberg (2004)"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/972639.972642","volume":"51","author":"J. H\u00e5stad","year":"2004","unstructured":"H\u00e5stad, J., N\u00e5slund, M.: The security of all rsa and discrete log bits. J. ACM\u00a051(2), 187\u2013230 (2004)","journal-title":"J. ACM"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-36563-X_17","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"B. M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Provably secure public-key encryptionfor length-preserving chaumian mixes. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 244\u2013262. Springer, Heidelberg (2003)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications (1978)","DOI":"10.21236\/ADA606588"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70630-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:26:28Z","timestamp":1620001588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70630-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540706298","9783540706304"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70630-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}