{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:10Z","timestamp":1747104190868},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006220"},{"type":"electronic","value":"9783540364924"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/3-540-36492-7_22","type":"book-chapter","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T19:36:10Z","timestamp":1193168170000},"page":"339-352","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Secure Block Ciphers Are Not Sufficient for One-Way Hash Functions in the Preneel-Govaerts-Vandewalle Model"],"prefix":"10.1007","author":[{"given":"Shoichi","family":"Hirose","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"CRYPTO\u201989","author":"I. B. Damg\u00e5rd","year":"1990","unstructured":"I. B. Damg\u00e5rd. A design principle for hash functions. In CRYPTO\u201989, pages 416\u2013427, 1990. Lecture Notes in Computer Science 435."},{"unstructured":"D. Davies and W. L. Price. Digital signatures, an update. In Proceedings of the 5th International Conference on Computer Communication, pages 845\u2013849, 1984.","key":"22_CR2"},{"key":"22_CR3","first-page":"5658","volume":"27","author":"S. M. Matyas","year":"1985","unstructured":"S. M. Matyas, C. H. Meyer, and J. Oseas. Generating strong one-way functions with cryptographic algorithm. IBM Technical Disclosure Bulletin, 27:5658\u20135659, 1985.","journal-title":"IBM Technical Disclosure Bulletin"},{"unstructured":"A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.","key":"22_CR4"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF00203968","volume":"3","author":"R. C. Merkle","year":"1990","unstructured":"R. C. Merkle. A fast software one-way hash function. Journal of Cryptology, 3:43\u201358, 1990.","journal-title":"Journal of Cryptology"},{"unstructured":"C. H. Meyer and M. Schilling. Secure program load with manipulation detection code. In Proceedings of the 6th Worldwide Congress on Computer and Communications Security and Protection (SECURICOM\u201988), pages 111\u2013130, 1988.","key":"22_CR6"},{"unstructured":"B. Preneel. Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, 1993.","key":"22_CR7"},{"key":"22_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-48969-X_8","volume-title":"Lectures on Data Security","author":"B. Preneel","year":"1998","unstructured":"B. Preneel. The state of cryptographic hash functions. In Lectures on Data Security, pages 158\u2013182, 1998. Lecture Notes in Computer Science 1561."},{"key":"22_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-48329-2_31","volume-title":"CRYPTO\u201993","author":"B. Preneel","year":"1994","unstructured":"B. Preneel, R. Govaerts, and J. Vandewalle. Hash functions based on block ciphers: A synthetic approach. In CRYPTO\u201993, pages 368\u2013378, 1994. Lecture Notes in Computer Science 773."},{"key":"22_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"EUROCRYPT\u201998","author":"D. R. Simon","year":"1998","unstructured":"D. R. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In EUROCRYPT\u201998, pages 334\u2013345, 1998. Lecture Notes in Computer Science 1403."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36492-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T03:04:27Z","timestamp":1579143867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36492-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006220","9783540364924"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36492-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"17 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}