{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:17:02Z","timestamp":1753600622556},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T00:00:00Z","timestamp":1364428800000},"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":["J Cryptol"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00145-013-9148-7","type":"journal-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T10:10:21Z","timestamp":1364379021000},"page":"397-428","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Robust Multi-Property Combiners for Hash Functions"],"prefix":"10.1007","volume":"27","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]},{"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,28]]},"reference":[{"key":"9148_CR1","unstructured":"Open source implementation of the Com4P combiner (2010). \n                    http:\/\/files.randombit.net\/botan\/doxygen\/html\/classBotan_1_1Comb4P.html"},{"key":"9148_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-76900-2_8","volume-title":"Advances in Cryptology\u2014Asiacrypt 2007","author":"E. Andreeva","year":"2007","unstructured":"E. Andreeva, G. Neven, B. Preneel, T. Shrimpton, Seven-property-preserving iterated hashing: ROX, in Advances in Cryptology\u2014Asiacrypt 2007. LNCS, vol.\u00a04833 (Springer, Berlin, 2007), pp. 130\u2013146"},{"key":"9148_CR3","series-title":"LNCS","first-page":"1","volume-title":"Advances in Cryptology\u2014Crypto 1996","author":"M. Bellare","year":"1996","unstructured":"M. Bellare, R. Canetti, H. Krawczyk, Keying hash functions for message authentication, in Advances in Cryptology\u2014Crypto 1996. LNCS, vol. 96 (Springer, Berlin, 1996), pp. 1\u201315"},{"key":"9148_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11935230_20","volume-title":"Advances in Cryptology\u2014Asiacrypt 2006","author":"M. Bellare","year":"2006","unstructured":"M. Bellare, T. Ristenpart, Multi-property preserving hash domain extensions and the EMD transform, in Advances in Cryptology\u2014Asiacrypt 2006. LNCS, vol. 4284 (Springer, Berlin, 2006), pp. 299\u2013314"},{"key":"9148_CR5","series-title":"LNCS","first-page":"399","volume-title":"International Colloquium on Automata, Languages, and Programming (ICALP) 2007","author":"M. Bellare","year":"2007","unstructured":"M. Bellare, T. Ristenpart, Hash functions in the dedicated-key setting: design choices and MPP transforms, in International Colloquium on Automata, Languages, and Programming (ICALP) 2007. LNCS, vol. 4596 (Springer, Berlin, 2007), pp. 399\u2013410"},{"key":"9148_CR6","series-title":"LNCS","first-page":"92","volume-title":"Advances in Cryptology\u2014Eurocrypt 1994","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, P. Rogaway, Optimal asymmetric encryption\u2014how to encrypt with RSA, in Advances in Cryptology\u2014Eurocrypt 1994. LNCS, vol. 950 (Springer, Berlin, 1994), pp. 92\u2013111"},{"key":"9148_CR7","series-title":"LNCS","first-page":"399","volume-title":"Advances in Cryptology\u2014Eurocrypt 1996","author":"M. Bellare","year":"1996","unstructured":"M. Bellare, P. Rogaway, The exact security of digital signatures\u2014how to sign with RSA and Rabin, in Advances in Cryptology\u2014Eurocrypt 1996. LNCS, vol. 1070 (Springer, Berlin, 1996), pp. 399\u2013416"},{"key":"9148_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology\u2014Eurocrypt 2006","author":"M. Bellare","year":"2006","unstructured":"M. Bellare, P. Rogaway, The security of triple encryption and a framework for code-based game-playing proofs, in Advances in Cryptology\u2014Eurocrypt 2006. LNCS, vol. 4004 (Springer, Berlin, 2006), pp. 409\u2013426"},{"key":"9148_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11535218_25","volume-title":"Advances in Cryptology\u2014Crypto 2005","author":"A. Boldyreva","year":"2005","unstructured":"A. Boldyreva, M. Fischlin, Analysis of random oracle instantiation scenarios for OAEP and other practical schemes, in Advances in Cryptology\u2014Crypto 2005. LNCS, vol. 3621 (Springer, Berlin, 2005), pp. 412\u2013429"},{"key":"9148_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11935230_14","volume-title":"Advances in Cryptology\u2014Asiacrypt 2006","author":"A. Boldyreva","year":"2006","unstructured":"A. Boldyreva, M. Fischlin, On the security of OAEP, in Advances in Cryptology\u2014Asiacrypt 2006. LNCS, vol. 4284 (Springer, Berlin, 2006), pp. 210\u2013225"},{"key":"9148_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/11818175_34","volume-title":"Advances in Cryptology\u2014Crypto 2006","author":"D. Boneh","year":"2006","unstructured":"D. Boneh, X. Boyen, On the impossibility of efficiently combining collision resistant hash functions, in Advances in Cryptology\u2014Crypto 2006. LNCS, vol. 4117 (Springer, Berlin, 2006), pp. 570\u2013583"},{"key":"9148_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-74143-5_15","volume-title":"Advances in Cryptology\u2014Crypto 2007","author":"R. Canetti","year":"2007","unstructured":"R. Canetti, R.L. Rivest, M. Sudan, L. Trevisan, S.P. Vadhan, H. Wee, Amplifying collision resistance: a\u00a0complexity-theoretic treatment, in Advances in Cryptology\u2014Crypto 2007. LNCS, vol. 4622 (Springer, Berlin, 2007), pp. 264\u2013283"},{"key":"9148_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-85174-5_11","volume-title":"Advances in Cryptology\u2014Crypto 2008","author":"C. Canni\u00e8re De","year":"2008","unstructured":"C. De Canni\u00e8re, C. Rechberger, Preimages for reduced SHA-0 and SHA-1, in Advances in Cryptology\u2014Crypto 2008. LNCS, vol. 5157 (Springer, Berlin, 2008), pp. 179\u2013202"},{"key":"9148_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology\u2014Crypto 2005","author":"J.-S. Coron","year":"2005","unstructured":"J.-S. Coron, Y. Dodis, C. Malinaud, P. Puniya, Merkle\u2013Damg\u00e5rd revisited: how to construct a hash function, in Advances in Cryptology\u2014Crypto 2005. LNCS, vol. 3621 (Springer, Berlin, 2005), pp. 430\u2013448"},{"key":"9148_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-74143-5_13","volume-title":"Advances in Cryptology\u2014Crypto 2007","author":"M. Fischlin","year":"2007","unstructured":"M. Fischlin, A. Lehmann, Security-amplifying combiners for hash functions, in Advances in Cryptology\u2014Crypto 2007. LNCS, vol. 4622 (Springer, Berlin, 2007), pp. 224\u2013243"},{"key":"9148_CR16","series-title":"LNCS","first-page":"375","volume-title":"Theory of Cryptography Conference (TCC) 2008","author":"M. Fischlin","year":"2008","unstructured":"M. Fischlin, A. Lehmann, Multi-property preserving combiners for hash functions, in Theory of Cryptography Conference (TCC) 2008. LNCS, vol. 4948 (Springer, Berlin, 2008), pp. 375\u2013392"},{"key":"9148_CR17","series-title":"LNCS","first-page":"655","volume-title":"International Colloquium on Automata, Languages, and Programming (ICALP) 2008","author":"M. Fischlin","year":"2008","unstructured":"M. Fischlin, A. Lehmann, K. Pietrzak, Robust multi-property combiners for hash functions revisited, in International Colloquium on Automata, Languages, and Programming (ICALP) 2008. LNCS, vol. 5126 (Springer, Berlin, 2008), pp. 655\u2013666"},{"key":"9148_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology\u2014Eurocrypt 2005","author":"D. Harnik","year":"2005","unstructured":"D. Harnik, J. Kilian, M. Naor, O. Reingold, A. Rosen, On robust combiners for oblivious transfer and other primitives, in Advances in Cryptology\u2014Eurocrypt 2005. LNCS, vol. 3494 (Springer, Berlin, 2005), pp. 96\u2013113"},{"key":"9148_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-30574-3_13","volume-title":"Topics in Cryptology\u2014Cryptographer\u2019s Track, RSA Conference (CT-RSA) 2005","author":"A. Herzberg","year":"2005","unstructured":"A. Herzberg, On tolerant cryptographic constructions, in Topics in Cryptology\u2014Cryptographer\u2019s Track, RSA Conference (CT-RSA) 2005. LNCS, vol. 3376 (Springer, Berlin, 2005), pp. 172\u2013190"},{"issue":"2","key":"9148_CR20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.3233\/JCS-2009-0336","volume":"17","author":"A. Herzberg","year":"2009","unstructured":"A. Herzberg, Folklore, practice and theory of robust combiners. J. Comput. Secur.\n                  17(2), 159\u2013189 (2009)","journal-title":"J. Comput. Secur."},{"key":"9148_CR21","series-title":"LNCS","first-page":"616","volume-title":"International Colloquium on Automata, Languages, and Programming (ICALP) 2008","author":"J. Hoch","year":"2008","unstructured":"J. Hoch, A. Shamir, On the strength of the concatenated hash combiner when all the hash functions are weak, in International Colloquium on Automata, Languages, and Programming (ICALP) 2008. LNCS, vol. 5126 (Springer, Berlin, 2008), pp. 616\u2013630"},{"key":"9148_CR22","volume-title":"Proceedings of the Annual Conference on Computer and Communications Security (CCS)","author":"J. Katz","year":"2005","unstructured":"J. Katz, J.S. Shin, Modeling insider attacks on group key-exchange protocols, in Proceedings of the Annual Conference on Computer and Communications Security (CCS) (ACM, New York, 2005)"},{"key":"9148_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-10366-7_22","volume-title":"Advances in Cryptology\u2014Asiacrypt 2009","author":"A. Lehmann","year":"2009","unstructured":"A. Lehmann, S. Tessaro, A\u00a0modular design for hash functions: towards making the mix-compress-mix approach practical, in Advances in Cryptology\u2014Asiacrypt 2009. LNCS, vol. 5912 (Springer, Berlin, 2009), pp. 364\u2013381"},{"issue":"2","key":"9148_CR24","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby, C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput.\n                  17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"9148_CR25","series-title":"LNCS","first-page":"21","volume-title":"Theory of Cryptography Conference (TCC) 2004","author":"U. Maurer","year":"2004","unstructured":"U. Maurer, R. Renner, C. Holenstein, Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology, in Theory of Cryptography Conference (TCC) 2004. LNCS, vol. 2951 (Springer, Berlin, 2004), pp. 21\u201339"},{"issue":"1","key":"9148_CR26","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"M. Naor, O. Reingold, On the construction of pseudorandom permutations: Luby\u2013Rackoff revisited. J.\u00a0Cryptol.\n                  12(1), 29\u201366 (1999)","journal-title":"J.\u00a0Cryptol."},{"key":"9148_CR27","unstructured":"NIST. National institute of standards and technology: SHA-3 competition. \n                    http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/"},{"key":"9148_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-72540-4_2","volume-title":"Advances in Cryptology\u2014Eurocrypt 2007","author":"K. Pietrzak","year":"2007","unstructured":"K. Pietrzak, Non-trivial black-box combiners for collision-resistant hash-functions don\u2019t exist, in Advances in Cryptology\u2014Eurocrypt 2007. LNCS, vol. 4515 (Springer, Berlin, 2007), pp. 23\u201333"},{"key":"9148_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-85174-5_23","volume-title":"Advances in Cryptology\u2014Crypto 2008","author":"K. Pietrzak","year":"2008","unstructured":"K. Pietrzak, Compression from collisions, or why CRHF combiners have a long output, in Advances in Cryptology\u2014Crypto 2008. LNCS, vol. 5157 (Springer, Berlin, 2008), pp. 413\u2013432"},{"key":"9148_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-03356-8_4","volume-title":"Advances in Cryptology\u2014Crypto 2009","author":"M. Stevens","year":"2009","unstructured":"M. Stevens, A. Sotirov, J. Appelbaum, A. Lenstra, D. Molnar, D.A. Osvik, B. de Weger, Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate, in Advances in Cryptology\u2014Crypto 2009. LNCS, vol. 5677 (Springer, Berlin, 2009), pp. 55\u201373"},{"key":"9148_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology\u2014Crypto 2005","author":"X. Wang","year":"2005","unstructured":"X. Wang, Y.L. Yin, H. Yu, Finding collisions in the full SHA-1, in Advances in Cryptology\u2014Crypto 2005. LNCS, vol. 3621 (Springer, Berlin, 2005), pp. 17\u201336"},{"key":"9148_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11426639_2","volume-title":"Advances in Cryptology\u2014Eurocrypt 2005","author":"X. Wang","year":"2005","unstructured":"X. Wang, H. Yu, How to break MD5 and other hash functions, in Advances in Cryptology\u2014Eurocrypt 2005. LNCS, vol. 3494 (Springer, Berlin, 2005), pp. 19\u201335"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9148-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9148-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9148-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9148-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:10:49Z","timestamp":1586333449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9148-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,28]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9148"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9148-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,28]]},"assertion":[{"value":"27 October 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}