{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:12Z","timestamp":1725663492137},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540541950"},{"type":"electronic","value":"9783540474890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54195-0_66","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:36:31Z","timestamp":1330209391000},"page":"379-390","source":"Crossref","is-referenced-by-count":6,"title":["Duality between two cryptographic primitives"],"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","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. on Comp. 13 (1984) 850\u2013864.","journal-title":"SIAM J. on Comp."},{"key":"33_CR2","unstructured":"R. Boppana and R. Hirschfeld, Pseudorandom generations and complexity classes, in: S. Micali, ed., Randomness and Computation, (JAI Press Inc., 1989) 1\u201326."},{"key":"33_CR3","unstructured":"I. Damg\u00e5rd, A design principle for hash functions, Presented at Crypto'89 (1989)."},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali, How to construct random functions, J. of ACM 33 (1986) 792\u2013807.","journal-title":"J. of ACM"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, Probabilistic encryption, J. of Comp. and Sys. Sci. 28 (1984) 270\u2013299.","journal-title":"J. of Comp. and Sys. Sci."},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin and M. Luby, Pseudo-random generation from one-way functions, Proc. of the 21-th ACM STOC (1989) 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Luby, One-way functions are essential for complexity based cryptography, Proc. of the 30-th IEEE FOCS (1989) 230\u2013235.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"R. Merkle, One way hash functions and DES, Presented at Crypto'89 (1989).","DOI":"10.1007\/0-387-34805-0_40"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"S. Micali and C.P. Schnorr, Super-efficient, perfect random number generators, in: S. Goldwasser, ed., Proc. of Crypto'88, (Springer-Verlag, 1990) 173\u2013198.","DOI":"10.1007\/0-387-34799-2_14"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, Universal one-way hash functions and their cryptographic applications, Proc. of the 21-th ACM STOC (1989) 33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02252867","volume":"2","author":"K. Nishimura","year":"1990","unstructured":"K. Nishimura and M. Sibuya, Probability to meet in the middle, J. of Cryptology 2 (1990) 13\u201322.","journal-title":"J. of Cryptology"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and J. Carter, New hash functions and their use in authentication and set equality, J. of Comp. and Sys. Sci. 22 (1981) 265\u2013279.","journal-title":"J. of Comp. and Sys. Sci."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"A. Yao, Theory and applications of trapdoor functions, Proc. of the 23-th IEEE FOCS (1982) 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"33_CR14","unstructured":"Y. Zheng, T. Matsumoto and H. Imai, On the construction of block ciphers provably secure and not relying on any unproved hypotheses, Presented at Crypto'89, (1989)."},{"key":"33_CR15","unstructured":"Y. Zheng, T. Matsumoto and H. Imai, Connections among several versions of one-way hash functions, Proc. of IEICE of Japan E73 (July 1990)."},{"key":"33_CR16","unstructured":"Y. Zheng, T. Matsumoto and H. Imai, Structural properties of one-way hash functions, Presented at Crypto'90, (1990)."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54195-0_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:04Z","timestamp":1605646384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54195-0_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541950","9783540474890"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-54195-0_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}