{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:38:40Z","timestamp":1725705520533},"publisher-location":"Berlin, Heidelberg","reference-count":37,"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_31","type":"book-chapter","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T09:22:26Z","timestamp":1353057746000},"page":"504-525","source":"Crossref","is-referenced-by-count":3,"title":["Provable Security of the Knudsen-Preneel Compression Functions"],"prefix":"10.1007","author":[{"given":"Jooyoung","family":"Lee","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-25385-0_13","volume-title":"Asiacrypt 2011","author":"F. Armknecht","year":"2011","unstructured":"Armknecht, F., Fleischmann, E., Krause, M., Lee, J., Stam, M., Steinberger, J.: The Preimage Security of Double-Block-Length Compression Functions. In: Lee, D.H. (ed.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 233\u2013251. Springer, Heidelberg (2011)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11426639_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"E. Biham","year":"2005","unstructured":"Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., Jalby, W.: Collisions of SHA-0 and Reduced SHA-1. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 36\u201357. Springer, Heidelberg (2005)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/11426639_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Black","year":"2005","unstructured":"Black, J., Cochran, M., Shrimpton, T.: On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 526\u2013541. Springer, Heidelberg (2005)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 320\u2013325. Springer, Heidelberg (2002)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-23951-9_33","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"J.W. Bos","year":"2011","unstructured":"Bos, J.W., \u00d6zen, O., Stam, M.: Efficient Hashing Using the AES Instruction Set. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 507\u2013522. Springer, Heidelberg (2011)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-540-85174-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Canni\u00e8re De","year":"2008","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Preimages for Reduced SHA-0 and SHA-1. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 179\u2013202. Springer, Heidelberg (2008)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A Design Principle for Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-10868-6_10","volume-title":"Cryptography and Coding","author":"E. Fleischmann","year":"2009","unstructured":"Fleischmann, E., Gorski, M., Lucks, S.: Security of Cyclic Double Block Length Hash Functions. In: Parker, M.G. (ed.) Cryptography and Coding 2009. LNCS, vol.\u00a05921, pp. 153\u2013175. Springer, Heidelberg (2009)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11496618_24","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S. Hirose","year":"2005","unstructured":"Hirose, S.: Provably Secure Double-Block-Length Hash Functions in a Black-Box Model. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 330\u2013342. Springer, Heidelberg (2005)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11799313_14","volume-title":"Fast Software Encryption","author":"S. Hirose","year":"2006","unstructured":"Hirose, S.: Some Plausible Constructions of Double-Block-Length Hash Functions. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 210\u2013225. Springer, Heidelberg (2006)"},{"issue":"9","key":"31_CR11","doi-asserted-by":"publisher","first-page":"2524","DOI":"10.1109\/TIT.2002.801402","volume":"48","author":"L.R. Knudsen","year":"2002","unstructured":"Knudsen, L.R., Preneel, B.: Construction of secure and fast hash functions using non binary error-correcting codes. IEEE Transactions on Information Theory\u00a048(9), 2524\u20132539 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BFb0052257","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"L.R. Knudsen","year":"1997","unstructured":"Knudsen, L.R., Preneel, B.: Fast and Secure Hashing Based on Codes. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 485\u2013498. Springer, Heidelberg (1997)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0034837","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"L.R. Knudsen","year":"1996","unstructured":"Knudsen, L.R., Preneel, B.: Hash Functions Based on Block Ciphers and Quaternary Codes. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 77\u201390. Springer, Heidelberg (1996)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-47555-9_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"X. Lai","year":"1993","unstructured":"Lai, X., Massey, J.L.: Hash Functions Based on Block Ciphers. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 55\u201370. Springer, Heidelberg (1993)"},{"key":"31_CR15","unstructured":"Lee, J., Kwon, D.: The security of Abreast-DM in the ideal cipher model. IACR ePrint Archive 2009\/225 (2009)"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-19074-2_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"J. Lee","year":"2011","unstructured":"Lee, J., Stam, M.: MJH: A Faster Alternative to MDC-2. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 213\u2013236. Springer, Heidelberg (2011)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/978-3-642-22792-9_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J. Lee","year":"2011","unstructured":"Lee, J., Stam, M., Steinberger, J.: The Collision Security of Tandem-DM in the Ideal Cipher Model. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 561\u2013577. Springer, Heidelberg (2011)"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-71039-4_26","volume-title":"Fast Software Encryption","author":"G. Leurent","year":"2008","unstructured":"Leurent, G.: MD4 is Not One-Way. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 412\u2013428. Springer, Heidelberg (2008)"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11799313_9","volume-title":"Fast Software Encryption","author":"F. Mendel","year":"2006","unstructured":"Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of Step-Reduced SHA-256. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 126\u2013143. Springer, Heidelberg (2006)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: One Way Hash Functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-13858-4_6","volume-title":"Fast Software Encryption","author":"O. \u00d6zen","year":"2010","unstructured":"\u00d6zen, O., Shrimpton, T., Stam, M.: Attacking the Knudsen-Preneel Compression Functions. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol.\u00a06147, pp. 94\u2013115. Springer, Heidelberg (2010)"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-10868-6_11","volume-title":"Cryptography and Coding","author":"O. \u00d6zen","year":"2009","unstructured":"\u00d6zen, O., Stam, M.: Another Glance at Double-Length Hashing. In: Parker, M.G. (ed.) Cryptography and Coding 2009. LNCS, vol.\u00a05921, pp. 176\u2013201. Springer, Heidelberg (2009)"},{"key":"31_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-17373-8_5","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"O. \u00d6zen","year":"2010","unstructured":"\u00d6zen, O., Stam, M.: Collision Attacks against the Knudsen-Preneel Compression Functions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 76\u201393. Springer, Heidelberg (2010)"},{"key":"31_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-72540-4_3","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Steinberger","year":"2007","unstructured":"Steinberger, J.: The Collision Intractability of MDC-2 in the Ideal-Cipher Model. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 34\u201351. Springer, Heidelberg (2007)"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-48329-2_31","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"B. Preneel","year":"1994","unstructured":"Preneel, B., Govaerts, R., Vandewalle, J.: Hash Functions Based on Block Ciphers: A Synthetic Approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 368\u2013378. Springer, Heidelberg (1994)"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-76900-2_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"T. Ristenpart","year":"2007","unstructured":"Ristenpart, T., Shrimpton, T.: How to Build a Hash Function from Any Collision-Resistant Function. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 147\u2013163. Springer, Heidelberg (2007)"},{"key":"31_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-3-540-85174-5_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"P. Rogaway","year":"2008","unstructured":"Rogaway, P., Steinberger, J.: Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 433\u2013450. Springer, Heidelberg (2008)"},{"key":"31_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-78967-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"P. Rogaway","year":"2008","unstructured":"Rogaway, P., Steinberger, J.: Security\/Efficiency Tradeoffs for Permutation-Based Hashing. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 220\u2013236. Springer, Heidelberg (2008)"},{"key":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-01001-9_8","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"Y. Sasaki","year":"2009","unstructured":"Sasaki, Y., Aoki, K.: Finding Preimages in Full MD5 Faster Than Exhaustive Search. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 134\u2013152. Springer, Heidelberg (2009)"},{"key":"31_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-540-70583-3_52","volume-title":"Automata, Languages and Programming","author":"T. Shrimpton","year":"2008","unstructured":"Shrimpton, T., Stam, M.: Building a Collision-Resistant Compression Function from Non-compressing Primitives. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 643\u2013654. Springer, Heidelberg (2008)"},{"key":"31_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/978-3-540-85174-5_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M. Stam","year":"2008","unstructured":"Stam, M.: Beyond Uniformity: Better Security\/Efficiency Tradeoffs for Compression Functions. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 397\u2013412. Springer, Heidelberg (2008)"},{"key":"31_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-03317-9_5","volume-title":"Fast Software Encryption","author":"M. Stam","year":"2009","unstructured":"Stam, M.: Blockcipher-Based Hashing Revisited. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol.\u00a05665, pp. 67\u201383. Springer, Heidelberg (2009)"},{"key":"31_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-72540-4_3","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Steinberger","year":"2007","unstructured":"Steinberger, J.: The Collision Intractability of MDC-2 in the Ideal-Cipher Model. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 34\u201351. Springer, Heidelberg (2007)"},{"key":"31_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11426639_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 1\u201318. Springer, Heidelberg (2005)"},{"key":"31_CR35","series-title":"Lecture Notes in Computer Science","first-page":"17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"31_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11426639_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"key":"31_CR37","unstructured":"Watanabe, D.: A note on the security proof of Knudsen-Preneel construction of a hash function (2006), \n                    \n                      http:\/\/csrc.nist.gov\/pki\/HashWorkshop\/2006\/UnacceptedPapers\/WATANABE_kp_attack.pdf"}],"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_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:08:39Z","timestamp":1620133719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34961-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642349607","9783642349614"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34961-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}