{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:01Z","timestamp":1725488341944},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_30","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"433-441","source":"Crossref","is-referenced-by-count":3,"title":["Necessary and Sufficient Conditions for Collision-Free Hashing"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Russell","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Manual Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal of Computing, 13(4):850\u2013864, November 1984.","journal-title":"SIAM Journal of Computing"},{"key":"30_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Proceedings of EUROCRYPT\u2019 87","author":"I. Damg\u00e5rd","year":"1988","unstructured":"Ivan Damg\u00e5rd. Collision free hash functions and public key signature schemes. In Proceedings of EUROCRYPT\u2019 87, volume 304 of Lecture Notes in Computer Science, pages 203\u2013216, Berlin, 1988. Springer-Verlag."},{"key":"30_CR3","series-title":"Lect Notes Comput Sci","first-page":"412","volume-title":"Proceedings of EUROCRYPT\u2019 90","author":"A. Santis De","year":"1990","unstructured":"Alfredo De Santis and Moti Yung. On the design of provably-secure cryptographic hash functions. In Proceedings of EUROCRYPT\u2019 90, volume 473 of Lecture Notes in Computer Science, pages 412\u2013431, Berlin, 1990. Springer-Verlag."},{"issue":"4","key":"30_CR4","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4):792\u2013807, October 1986.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM Journal of Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM Journal of Computing"},{"doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad. Pseudo-random generators under uniform assumptions. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 395\u2013404. ACM, 1990.","key":"30_CR6","DOI":"10.1145\/100216.100270"},{"doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 12\u201324. ACM, 1989.","key":"30_CR7","DOI":"10.1145\/73007.73009"},{"unstructured":"Toshiya Itoh. Personal communication, August 1992.","key":"30_CR8"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L. A. Levin","year":"1986","unstructured":"Leonid A. Levin. Average case complete problems. SIAM Journal on Computing, 15:285\u2013286, 1986.","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 33\u201343. ACM, 1989.","key":"30_CR10","DOI":"10.1145\/73007.73011"},{"unstructured":"Wakaha Ogata and Kaoru Kurosawa. On claw free families. In Proceedings of ASIACRYPT\u2019 91, 1991.","key":"30_CR11"},{"doi-asserted-by":"crossref","unstructured":"John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 387\u2013394. ACM, 1990.","key":"30_CR12","DOI":"10.1145\/100216.100269"},{"doi-asserted-by":"crossref","unstructured":"A. Yao. Theory and applications of trapdoor functions. In Proceedings of the Twenty Third IEEE Symposium on Foundations of Computer Science, pages 80\u201391. IEEE, 1982.","key":"30_CR13","DOI":"10.1109\/SFCS.1982.45"},{"key":"30_CR14","series-title":"Lect Notes Comput Sci","first-page":"379","volume-title":"Proceedings of the Eighth International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"Y. Zheng","year":"1990","unstructured":"Yuliang Zheng, Tsutomu Matsumoto, and Hideki Imai. Duality between two cryptographic primitives. In Proceedings of the Eighth International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 508 of Lecture Notes in Computer Science, pages 379\u2013390, Berlin, 1990. Springer-Verlag."},{"key":"30_CR15","series-title":"Lect Notes Comput Sci","first-page":"285","volume-title":"Proceedings of CRYPTO\u2019 90","author":"Y. Zheng","year":"1990","unstructured":"Yuliang Zheng, Tsutomu Matsumoto, and Hideki Imai. Structural properties of one-way hash functions. In Proceedings of CRYPTO\u2019 90, volume 537 of Lecture Notes in Computer Science, pages 285\u2013302, Berlin, 1990. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:18Z","timestamp":1605647718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_30","relation":{},"subject":[]}}