{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T06:05:26Z","timestamp":1747893926352},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_21","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"285-302","source":"Crossref","is-referenced-by-count":8,"title":["Structural Properties of One-Way Hash Functions"],"prefix":"10.1007","author":[{"given":"Yuliang","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Tsutomu","family":"Matsumoto","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97062-7","volume-title":"Structural Complexity I","author":"J. Balc\u00e1zar","year":"1988","unstructured":"J. Balc\u00e1zar, J. D\u00edaz and J. Gabarr\u00f3: Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1988."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Carter","year":"1979","unstructured":"J. Carter and M. Wegman: \u201cUniversal classes of hash functions\u201d, Journal of Computer and System Sciences, Vol.18, 1979, pp.143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd: \u201cCollision free hash functions and public key signature schemes\u201d, Proceedings of EuroCrypt\u201987, 1987, pp.203\u2013216.","DOI":"10.1007\/3-540-39118-5_19"},{"key":"21_CR4","unstructured":"I. Damg\u00e5rd: \u201cA design principle for hash functions\u201d, Presented at Crypto\u201989, 1989."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"A. De Santis and M. Yung: \u201cOn the design of provably-secure cryptographic hash functions\u201d, Presented at EuroCrypt\u201990, 1990.","DOI":"10.1007\/3-540-46877-3_37"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin and M. Luby: \u201cPseudo-random generation from one-way functions\u201d, Proceedings of the 21-th ACM Symposium on Theory of Computing, 1989, pp.12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"21_CR7","first-page":"191","volume":"28","author":"R. Karp","year":"1982","unstructured":"R. Karp and R. Lipton: \u201cTuring machines that take advice\u201d, L\u2019enseigment Mathematique, Vol.28, 1982, pp.191\u2013209.","journal-title":"L\u2019enseigment Mathematique"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"R. Merkle: \u201cOne way hash functions and DES\u201d, Presented at Crypto\u201989, 1989.","DOI":"10.1007\/0-387-34805-0_40"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung: \u201cUniversal one-way hash functions and their cryptographic applications\u201d, Proceedings of the 21-th ACM Symposium on Theory of Computing, 1989, pp.33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"N. Pippenger: \u201cOn simultaneous resource bounds\u201d, Proceedings of the 20-th IEEE Symposium on the Foundations of Computer Science, 1979, pp.307\u2013311.","DOI":"10.1109\/SFCS.1979.29"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"J. Rompel: \u201cOne-way functions are necessary and sufficient for secure signatures\u201d, Proceedings of the 22-nd ACM Symposium on Theory of Computing, 1990, pp.387\u2013394.","DOI":"10.1145\/100216.100269"},{"key":"21_CR12","unstructured":"O. Watanabe: \u201cOn one-way functions\u201d, Presented at the International Symposium on Combinatorial Optimization, Tianjin, China, 1988."},{"key":"21_CR13","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 J. Carter: \u201cNew hash functions and their use in authentication and set equality\u201d, Journal of Computer and System Sciences, Vol.22, 1981, pp.265\u2013279.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"A. Yao: \u201cTheory and applications of trapdoor functions\u201d, Proceedings of the 23-rd IEEE Symposium on the Foundations of Computer Science, 1982, pp.80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"21_CR15","unstructured":"Y. Zheng, T. Matsumoto and H. Imai: \u201cDuality between two cryptographic primitives\u201d, To be presented at 8-th International Conference on Applied Algebra, Algebraic Algorithms and Error Correcting Codes (AAECC-8), Tokyo, August 1990. A preliminary version appears in IEICE Technical Reports on Information Security, TG ISEC89-46, March 16, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:12Z","timestamp":1605647112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_21","relation":{},"subject":[]}}