{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:31:49Z","timestamp":1761647509572},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675174"},{"type":"electronic","value":"9783540455394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_32","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:26:08Z","timestamp":1184603168000},"page":"445-452","source":"Crossref","is-referenced-by-count":53,"title":["A Composition Theorem for Universal One-Way Hash Functions"],"prefix":"10.1007","author":[{"given":"Victor","family":"Shoup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Collision-resistant hashing: towards making UOWHFs practical. In Advances in Cryptology-Crypto\u2019 97, 1997.","DOI":"10.1007\/BFb0052256"},{"key":"32_CR2","unstructured":"I. Damgard. Collision free hash functions and public key signature schemes. In Advances in Cryptology-Eurocrypt\u2019 87, 1987."},{"key":"32_CR3","unstructured":"I. Damgard. A design principle for hash functions. In Advances in Cryptology-Crypto\u2019 89, 1989."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"D. den Boer and A. Bosselaers. Collisions for the compression function of MD5. In Advances in Cryptology-Eurocrypt\u2019 93, pages 293\u2013304, 1993.","DOI":"10.1007\/3-540-48285-7_26"},{"key":"32_CR5","unstructured":"H. Dobbertin. The status of MD5 after a recent attack. RSA Laboratories\u2019 CryptoBytes, 2(2), 1996. The main result of this paper was announced at the Eurocrypt\u2019 96 rump session."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"R. Merkle. One way hash functions and DES. In Advances in Cryptology-Crypto\u2019 89, 1989.","DOI":"10.1007\/0-387-34805-0_40"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st Annual ACM Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73011"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"D. Simon. Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In Advances in Cryptology-Eurocrypt\u2019 98, pages 334\u2013345, 1998.","DOI":"10.1007\/BFb0054137"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, 22:265\u2013279, 1981.","journal-title":"J. of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T01:50:53Z","timestamp":1587779453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}