{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:13Z","timestamp":1725663853206},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573326"},{"type":"electronic","value":"9783540480662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57332-1_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:51:10Z","timestamp":1330260670000},"page":"97-110","source":"Crossref","is-referenced-by-count":0,"title":["How to construct a family of strong one way permutations"],"prefix":"10.1007","author":[{"given":"Babak","family":"Sadeghiyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuliang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr. RSA and Rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing, 17(2):194\u2013209, 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","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 Journal on Computing, 13(4):850\u2013864, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Manuel Blum and Shafi Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. In Advances in Cryptology \u2014 CRYPTO '84, volume 196 of Lecture Notes in Computer Science, pages 289\u2013299. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-39568-7_23"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators. In Proceedings of the 29th IEEE Symposium on the Foundations of Computer Science, pages 12\u201324, 1988.","DOI":"10.1109\/SFCS.1988.21917"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In the 21st ACM Symposium on Theory of Computing, pages 25\u201332, 1989.","DOI":"10.1145\/73007.73010"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System-Sciences, 28:270\u2013299, 1984.","journal-title":"Journal of Computer and System-Sciences"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from oneway functions. In the 21st ACM Symposium on Theory of Computing, pages 12\u201324, 1989.","DOI":"10.1145\/73007.73009"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"Douglas L. L. Long","year":"1988","unstructured":"Douglas L. Long and Avi Wigderson. The Discrete Logarithm Hides O(log n) Bits. SIAM Journal on Computing, 17(2):363\u2013372, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"J. Rompel. One-way functions are necessary and sufficient for secure signatures. In the 22nd ACM Symposium on Theory of Computing, pages 387\u2013394, 1990.","DOI":"10.1145\/100216.100269"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"B. Sadeghiyan and J. Pieprzyk. A construction for one way hash functions and pseudorandom bit generators. Technical Report CS 91\/2, University College, The University of New South Wales, 1991. Also in the Abstracts of EUROCRYPT '91.","DOI":"10.1007\/3-540-46416-6_37"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"A. Scherift and A. Shamir. Discrete logarithm is very discreet. In Proceedings of the ACM Symposium on Theory of Computing, pages 405\u2013415, 1990.","DOI":"10.1145\/100216.100271"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"U. V. Vazirani and V. V. Vazirani. Efficient and Secure Pseudo-random Number Generation. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 458\u2013463, 1984.","DOI":"10.1109\/SFCS.1984.715948"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22:265\u2013279, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Y. Zheng, T. Matsumoto, and H. Imai. Duality between Two Cryptographic Primitives. In the 8-th International Conference on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, page 15, 1990.","DOI":"10.1007\/3-540-54195-0_66"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57332-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:42Z","timestamp":1605647502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57332-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573326","9783540480662"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57332-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}