{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T21:28:35Z","timestamp":1764797315248,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1526801,CNS-1717640"],"award-info":[{"award-number":["CNS-1526801,CNS-1717640"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004318","name":"Microsoft","doi-asserted-by":"publisher","award":["Gift"],"award-info":[{"award-number":["Gift"]}],"id":[{"id":"10.13039\/100004318","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["Project ERCC FP7\/615074"],"award-info":[{"award-number":["Project ERCC FP7\/615074"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134087","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"891-906","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Better Than Advertised"],"prefix":"10.1145","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Joseph","family":"Jaeger","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Julia","family":"Len","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"volume-title":"Mike Burmester","author":"Andreeva Elena","key":"e_1_3_2_2_1_1","unstructured":"Elena Andreeva, Bart Mennink, and Bart Preneel. 2011. Security Reductions of the Second Round SHA-3 Candidates ISC 2010 (LNCS), Mike Burmester, Gene Tsudik, Spyros S. Magliveras, and Ivana Ilic (Eds.), Vol. Vol. 6531. Springer, Heidelberg, 39--53."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2_8"},{"volume-title":"Liqun Chen (Ed.)","author":"Andreeva Elena","key":"e_1_3_2_2_3_1","unstructured":"Elena Andreeva and Martijn Stam 2011. The Symbiosis between Collision and Preimage Resistance 13th IMA International Conference on Cryptography and Coding (LNCS), Liqun Chen (Ed.), Vol. Vol. 7089. Springer, Heidelberg, 152--171."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_4"},{"key":"e_1_3_2_2_5_1","volume-title":"Computer Security Foundations Symposium (CSF)","author":"Backes Michael","year":"2012","unstructured":"Michael Backes, Gilles Barthe, Matthias Berg, Benjamin Gr\u00e9goire, C\u00e9sar Kunz, Malte Skoruppa, and Santiago Zanella B\u00e9guelin. 2012. Verified security of merkle-damg\u00e5rd. In Computer Security Foundations Symposium (CSF), 2012 IEEE 25th. IEEE, 354--368."},{"volume-title":"Cynthia Dwork (Ed.)","author":"Bellare Mihir","key":"e_1_3_2_2_6_1","unstructured":"Mihir Bellare. 2006. New Proofs for NMAC and HMAC: Security without Collision-Resistance CRYPTO 2006 (LNCS), Cynthia Dwork (Ed.), Vol. Vol. 4117. Springer, Heidelberg, 602--619."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--49890--3_22"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68697-5_1"},{"volume-title":"Pseudorandom functions revisited: The cascade construction and its concrete security 37th FOCS","author":"Bellare Mihir","key":"e_1_3_2_2_9_1","unstructured":"Mihir Bellare, Ran Canetti, and Hugo Krawczyk. 1996. Pseudorandom functions revisited: The cascade construction and its concrete security 37th FOCS. IEEE Computer Society Press, 514--523."},{"key":"e_1_3_2_2_10_1","volume-title":"Multi-Property-Preserving Hash Domain Extension and the EMD Transform ASIACRYPT 2006 (LNCS), Xuejia Lai and Kefei Chen (Eds.)","volume":"4284","author":"Bellare Mihir","year":"2006","unstructured":"Mihir Bellare and Thomas Ristenpart 2006. Multi-Property-Preserving Hash Domain Extension and the EMD Transform ASIACRYPT 2006 (LNCS), Xuejia Lai and Kefei Chen (Eds.), Vol. Vol. 4284. Springer, Heidelberg, 299--314."},{"volume-title":"Serge Vaudenay (Ed.)","author":"Bellare Mihir","key":"e_1_3_2_2_11_1","unstructured":"Mihir Bellare and Phillip Rogaway 2006. The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs EUROCRYPT 2006 (LNCS), Serge Vaudenay (Ed.), Vol. Vol. 4004. Springer, Heidelberg, 409--426."},{"volume-title":"Moti Yung (Ed.)","author":"Black John","key":"e_1_3_2_2_12_1","unstructured":"John Black, Phillip Rogaway, and Thomas Shrimpton. 2002. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV CRYPTO 2002 (LNCS), Moti Yung (Ed.), Vol. Vol. 2442. Springer, Heidelberg, 320--335."},{"key":"e_1_3_2_2_13_1","volume-title":"Contributions to IEEE P1363a. (Feb","author":"Daniel R. L. Brown. 2002. Generic Groups","year":"2002","unstructured":"Daniel R. L. Brown. 2002. Generic Groups, Collision Resistance, and ECDSA. Contributions to IEEE P1363a. (Feb. 2002). shownoteUpdated version for \"The Exact Security of ECDSA.\" Available from http:\/\/grouper.ieee.org\/groups\/1363\/."},{"volume-title":"Collision Free Hash Functions and Public Key Signature Schemes EUROCRYPT'87 (LNCS), David Chaum and Wyn L","author":"Damg\u00e5rd Ivan","key":"e_1_3_2_2_14_1","unstructured":"Ivan Damg\u00e5rd. 1988. Collision Free Hash Functions and Public Key Signature Schemes EUROCRYPT'87 (LNCS), David Chaum and Wyn L. Price (Eds.), Vol. Vol. 304. Springer, Heidelberg, 203--216."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_39"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Hans Dobbertin. 1996. Cryptanalysis of MD5 Compress. (1996).","DOI":"10.1007\/3-540-60865-6_43"},{"volume-title":"Getting the Best Out of Existing Hash Functions","author":"Dodis Yevgeniy","key":"e_1_3_2_2_17_1","unstructured":"Yevgeniy Dodis and Prashant Puniya 2008. Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA? In ACNS 08 (LNCS), Steven M. Bellovin, Rosario Gennaro, Angelos D. Keromytis, and Moti Yung (Eds.), Vol. Vol. 5037. Springer, Heidelberg, 156--173."},{"key":"e_1_3_2_2_18_1","volume-title":"Salvaging Merkle-Damg\u00e5rd for Practical Applications EUROCRYPT 2009 (LNCS), Antoine Joux (Ed.)","volume":"5479","author":"Dodis Yevgeniy","year":"2009","unstructured":"Yevgeniy Dodis, Thomas Ristenpart, and Thomas Shrimpton. 2009. Salvaging Merkle-Damg\u00e5rd for Practical Applications EUROCRYPT 2009 (LNCS), Antoine Joux (Ed.), Vol. Vol. 5479. Springer, Heidelberg, 371--388."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_7"},{"volume-title":"Introduction to modern cryptography","author":"Katz Jonathan","key":"e_1_3_2_2_20_1","unstructured":"Jonathan Katz and Yehuda Lindell 2014. Introduction to modern cryptography. CRC press."},{"volume-title":"Handbook of applied cryptography","author":"Menezes Alfred J","key":"e_1_3_2_2_22_1","unstructured":"Alfred J Menezes, Paul C. Van Oorschot, and Scott A Vanstone. 1996. Handbook of applied cryptography. CRC press."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00203968"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_40"},{"key":"e_1_3_2_2_25_1","volume-title":"Secure Hash Standard. (August","author":"NIST","year":"2015","unstructured":"NIST August 2015. FIPS 180--4, Secure Hash Standard. (August 2015)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1321"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-38424-3_22"},{"volume-title":"Second-Preimage Resistance, and Collision Resistance FSE 2004 (LNCS), Bimal K","author":"Rogaway Phillip","key":"e_1_3_2_2_28_1","unstructured":"Phillip Rogaway and Thomas Shrimpton 2004. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance FSE 2004 (LNCS), Bimal K. Roy and Willi Meier (Eds.), Vol. Vol. 3017. Springer, Heidelberg, 371--388."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_19"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_18"},{"volume-title":"Cryptography: theory and practice","author":"Stinson Douglas R","key":"e_1_3_2_2_31_1","unstructured":"Douglas R Stinson. 2005. Cryptography: theory and practice. CRC press."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-005-6344-y"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_2"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134087","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134087"}},"subtitle":["Improved Collision-Resistance Guarantees for MD-Based Hash Functions"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":32,"alternative-id":["10.1145\/3133956.3134087","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134087","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}