{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:44Z","timestamp":1766281004114},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645184"},{"type":"electronic","value":"9783540697954"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0054137","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:13:04Z","timestamp":1153991584000},"page":"334-345","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":181,"title":["Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?"],"prefix":"10.1007","author":[{"given":"Daniel R.","family":"Simon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"W. Aiello, S. Haber and R. Venkatesan, \u201cNew Constructions for Secure Hash Functions\u201d, Proc. Fifth Workshop on Fast Software Encryption (FSE5), 1998.","DOI":"10.1007\/3-540-69710-1_11"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"W. Aiello and R. Venkatesan, \u201cFoiling Birthday Attacks in LengthDoubling Transformations\u201d, Proc. EUROCRYPT '96, 1996.","DOI":"10.1007\/3-540-68339-9_27"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cRandom Oracles Are Practical: a Paradigm for Designing Efficient Protocols\u201d, Proc. 1st Annual Conference on Computer and Communications Security, 1993.","DOI":"10.1145\/168588.168596"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cOptimal Asymmetric Encryption\u201d, Proc. Eurocrypt '94, 1994.","DOI":"10.1007\/BFb0053428"},{"key":"25_CR5","unstructured":"I. Damg\u00e5rd, \u201cCollision-Free Hash Functions and Public-Key Signature Schemes\u201d, Proc. EUROCRYPT '87, 1987."},{"key":"25_CR6","unstructured":"I. Damg\u00e5rd, \u201cA Design Principle for Hash Functions\u201d, Proc. CRYPTO '89, 1989."},{"key":"25_CR7","unstructured":"D. Davies and W. Price, \u201cThe Application of Digital Signatures Based on Public-Key Cryptosystems\u201d, Proc. 5th International Computer Communications Conference, 1980."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"R. Merkle, \u201cOne Way Hash Functions and DES\u201d, Proc. CRYPTO '89, 1989.","DOI":"10.1007\/0-387-34805-0_40"},{"key":"25_CR9","unstructured":"National Institute of Standards and Technology, NIST FIPS PUB 186, \u201cDigital Signature Standard\u201d, U.S. Department of Commerce, 1994."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, \u201cUniversal Hash Functions and their Cryptographic Applications\u201d, Proc. 21st Annual Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73011"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"R. Rivest, \u201cThe MD5 Message Digest Algorithm\u201d, RFC 1321, 1992.","DOI":"10.17487\/rfc1321"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"J. Rompel, \u201cOne-Way Functions Are Necessary and Sufficient for Digital Signatures\u201d, Proc. 22nd Annual Symposium on Theory of Computing, 1990.","DOI":"10.1145\/100216.100269"},{"key":"25_CR13","unstructured":"A. Russell, \u201cNecessary and Sufficient Conditions for Collision-Free Hashing\u201d, Proc. CRYPTO '92, 1992."},{"issue":"5","key":"25_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/141809.141812","volume":"22","author":"G. Tsudik","year":"1992","unstructured":"G. Tsudik, \u201cMessage Authentication with One-Way Hash Functions\u201d, ACM Computer Communications Review v 22, no. 5, pp. 29\u201338, 1992.","journal-title":"ACM Computer Communications Review"},{"key":"25_CR15","unstructured":"Y. Zheng, T. Matsumoto and H. Imai, \u201cStructural Properties of One-Way Hash Functions\u201d, Proc. CRYPTO '90, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T14:05:08Z","timestamp":1587132308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645184","9783540697954"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0054137","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}