{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T11:13:57Z","timestamp":1790766837589,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662498897","type":"print"},{"value":"9783662498903","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-3-662-49890-3_19","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T04:40:46Z","timestamp":1461732046000},"page":"484-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["New Attacks on the Concatenation and XOR Hash Combiners"],"prefix":"10.1007","author":[{"given":"Itai","family":"Dinur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Bouillaguet, C., Dunkelman, O., Fouque, P.-A., Hoch, J., Kelsey, J., Shamir, A., Zimmer, S.: New second-preimage attacks on hash functions. J. Cryptol. 1\u201340. (to appear) (2015)","DOI":"10.1007\/s00145-015-9206-4"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-05445-7_25","volume-title":"Selected Areas in Cryptography","author":"E Andreeva","year":"2009","unstructured":"Andreeva, E., Bouillaguet, C., Dunkelman, O., Kelsey, J.: Herding, second preimage and trojan message attacks beyond Merkle-Damg\u00e5rd. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 393\u2013414. Springer, Heidelberg (2009)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-78967-3_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"E Andreeva","year":"2008","unstructured":"Andreeva, E., Bouillaguet, C., Fouque, P.-A., Hoch, J.J., Kelsey, J., Shamir, A., Zimmer, S.: Second preimage attacks on dithered hash functions. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 270\u2013288. Springer, Heidelberg (2008)"},{"key":"19_CR4","unstructured":"Biham, E., Dunkelman, O.: A framework for iterative hash functions- HAIFA. In: IACR Cryptology ePrint Archive (2007). \n                    http:\/\/eprint.iacr.org\/2007\/278"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/11818175_34","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Boyen, X.: On the impossibility of efficiently combining collision resistant hash functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 570\u2013583. Springer, Heidelberg (2006)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201989","year":"1990","unstructured":"Brassard, G. (ed.): CRYPTO 1989. LNCS, vol. 435. Springer, Heidelberg (1990)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","year":"2005","unstructured":"Cramer, R. (ed.): EUROCRYPT 2005. LNCS, vol. 3494. Springer, Heidelberg (2005)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: A design principle for hash functions. In: Brassard [6], pp. 416\u2013427","DOI":"10.1007\/0-387-34805-0_39"},{"key":"19_CR9","unstructured":"Dean, R.D.: Formal Aspects of Mobile Code Security. Ph.D. thesis, Princeton University (1999)"},{"key":"19_CR10","unstructured":"Dierks, T., Rescorla, E.: The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246 (2008). \n                    https:\/\/www.ietf.org\/rfc\/rfc5246.txt"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Dinur, I., Leurent, G.: Improved generic attacks against hash-based MACs and HAIFA. In: Garay, J.A., Gennaro, R. (eds.) [16], pp. 149\u2013168","DOI":"10.1007\/978-3-662-44371-2_9"},{"key":"19_CR12","unstructured":"Dunkelman, O., Preneel, B.: Generalizing the herding attack to concatenated hashing schemes. In: ECRYPT Hash Workshopp (2007)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-78524-8_21","volume-title":"Theory of Cryptography","author":"M Fischlin","year":"2008","unstructured":"Fischlin, M., Lehmann, A.: Multi-property preserving combiners for hash functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 375\u2013392. Springer, Heidelberg (2008)"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00145-013-9148-7","volume":"27","author":"M Fischlin","year":"2014","unstructured":"Fischlin, M., Lehmann, A., Pietrzak, K.: Robust multi-property combiners for hash functions. J. Cryptol. 27(3), 397\u2013428 (2014)","journal-title":"J. Cryptol."},{"key":"19_CR15","unstructured":"Freier, A.O., Karlton, P., Kocher, P.C.: The Secure Sockets Layer (SSL) Protocol Version 3.0.RFC 6101 (2011). \n                    http:\/\/www.ietf.org\/rfc\/rfc6101.txt"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","year":"2014","unstructured":"Garay, J.A., Gennaro, R. (eds.): CRYPTO 2014, Part I. LNCS, vol. 8616. Springer, Heidelberg (2014)"},{"key":"19_CR17","first-page":"131","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Jian Guo","year":"2014","unstructured":"Guo, J., Peyrin, T., Sasaki, Y., Wang, L.: Updates on generic attacks against HMAC and NMAC. In: Garay, J.A., Gennaro, R. (eds.) [16], pp. 131\u2013148"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"ME Hellman","year":"1980","unstructured":"Hellman, M.E.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4), 401\u2013406 (1980)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11799313_12","volume-title":"Fast Software Encryption","author":"JJ Hoch","year":"2006","unstructured":"Hoch, J.J., Shamir, A.: Breaking the ICE - finding multicollisions in iterated concatenated and expanded (ICE) hash functions. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 179\u2013194. Springer, Heidelberg (2006)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-540-70583-3_50","volume-title":"Automata, Languages and Programming","author":"JJ Hoch","year":"2008","unstructured":"Hoch, J.J., Shamir, A.: On the strength of the concatenated hash combiner when all the hash functions are weak. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) Automata, Languages and Programming. LNCS, vol. 5126, pp. 616\u2013630. Springer, Heidelberg (2008)"},{"key":"19_CR21","unstructured":"Jha, A., Nandi, M.: Some Cryptanalytic Results on Zipper Hash and Concatenated Hash. IACR Cryptology ePrint Archive 2015:973 (2015)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-28628-8_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A Joux","year":"2004","unstructured":"Joux, A.: Multicollisions in iterated hash functions. Application to cascaded constructions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 306\u2013316. Springer, Heidelberg (2004)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Second preimages on n-Bit hash functions for much less than $$2^n$$ work. In: Cramer [7], pp. 474\u2013490","DOI":"10.1007\/11426639_28"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-42045-0_1","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"G Leurent","year":"2013","unstructured":"Leurent, G., Peyrin, T., Wang, L.: New generic attacks against hash-based MACs. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 1\u201320. Springer, Heidelberg (2013)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-662-46800-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"G Leurent","year":"2015","unstructured":"Leurent, G., Wang, L.: The sum can be weaker than each part. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 345\u2013367. Springer, Heidelberg (2015)"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-10366-7_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"F Mendel","year":"2009","unstructured":"Mendel, F., Rechberger, C., Schl\u00e4ffer, M.: MD5 is weaker than weak: attacks on concatenated combiners. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 144\u2013161. Springer, Heidelberg (2009)"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-319-12280-9_4","volume-title":"Cryptology and Network Security","author":"B Mennink","year":"2014","unstructured":"Mennink, B., Preneel, B.: Breaking and fixing cryptophia\u2019s short combiner. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 50\u201363. Springer, Heidelberg (2014)"},{"key":"19_CR28","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Ralph C. Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard [6], pp. 428\u2013446"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-642-32928-9_29","volume-title":"Security and Cryptography for Networks","author":"A Mittelbach","year":"2012","unstructured":"Mittelbach, A.: Hash combiners for second pre-image resistance, target collision resistance and pre-image resistance have long output. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 522\u2013539. Springer, Heidelberg (2012)"},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/TIT.2006.889721","volume":"53","author":"M Nandi","year":"2007","unstructured":"Nandi, M., Stinson, D.R.: Multicollision attacks on some generalized sequential hash functions. IEEE Trans. Inf. Theory 53(2), 759\u2013767 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/978-3-662-46706-0_5","volume-title":"Fast Software Encryption","author":"L Perrin","year":"2015","unstructured":"Perrin, L., Khovratovich, D.: Collision spectrum, entropy loss, T-Sponges, and cryptanalysis of GLUON-64. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 82\u2013103. Springer, Heidelberg (2015)"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-55220-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"T Peyrin","year":"2014","unstructured":"Peyrin, T., Wang, L.: Generic universal forgery attack on iterative hash-based MACs. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 147\u2013164. Springer, Heidelberg (2014)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-72540-4_2","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"K Pietrzak","year":"2007","unstructured":"Pietrzak, K.: Non-trivial black-box combiners for collision-resistant hash-functions don\u2019t exist. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 23\u201333. Springer, Heidelberg (2007)"},{"key":"19_CR34","unstructured":"Preneel, B.: Analysis and design of cryptographic hash functions. Ph.D. thesis, KU Leuven (1993)"},{"key":"19_CR35","unstructured":"Rjasko, M.: On existence of robust combiners for cryptographic hash functions. In: Vojt\u00e1s, P. (ed.) Proceedings of the Conference onTheory and Practice of Information Technologies, ITAT 2009, Horsk\u00fdhotel Kralova studna, Slovakia, September 25-29, 2009, volume 584 of CEUR Workshop Proceedings, pp. 71\u201376. CEUR-WS.org 2009"},{"issue":"1","key":"19_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","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. 3621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"19_CR38","first-page":"19","volume-title":"Lecture Notes in Computer Science","author":"Xiaoyun Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer [7], pp. 19\u201335"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49890-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T00:05:34Z","timestamp":1588809934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49890-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662498897","9783662498903"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49890-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 April 2016","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"}]}}