{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:46:50Z","timestamp":1786150010061,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642226694","type":"print"},{"value":"9783642226700","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22670-0_3","type":"book-chapter","created":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T09:10:18Z","timestamp":1311757818000},"page":"13-25","source":"Crossref","is-referenced-by-count":12,"title":["On Constructing 1-1 One-Way Functions"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonid A.","family":"Levin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Annals of Mathematics\u00a0160(2), 781\u2013793 (2004)","journal-title":"Annals of Mathematics"},{"key":"3_CR2","volume-title":"Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms (ACM Distinguished Dissertation 1984)","author":"E. Bach","year":"1985","unstructured":"Bach, E.: Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms (ACM Distinguished Dissertation 1984). MIT Press, Cambridge (1985)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bach, E.: Realistic Analysis of some Randomized Algorithms. In: 19th STOC, pp. 453\u2013461 (1987)","DOI":"10.1145\/28395.28444"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. on Computing\u00a013, 850\u2013864 (1984)","journal-title":"SIAM J. on Computing"},{"key":"3_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundation of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundation of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"3_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundation of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundation of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L., Venkatesan, R., Zuckerman, D.: Security Preserving Amplification of Hardness. In: 31st FOCS, pp. 318\u2013326 (1990)","DOI":"10.1109\/FSCS.1990.89550"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A Hard-Core Predicate for any One-way Function. In: 21st STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the Existence of Pseudorandom Generators. SIAM J. on Computing\u00a022, 1163\u20131175 (1993)","journal-title":"SIAM J. on Computing"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-24638-1_22","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2004","unstructured":"Haitner, I.: Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 394\u2013409. Springer, Heidelberg (2004)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.: Efficiency Improvements in Constructing Pseudorandom Generator from any One-way Function. In: 42nd STOC, pp. 437\u2013446 (2010)","DOI":"10.1145\/1806689.1806750"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A Pseudorandom Generator from any One-way Function. SICOMP\u00a028(4), 1364\u20131396 (1990); Combines papers of Impagliazzo, Levin, and Luby ( 21st STOC, 1989) and J. H\u00e5stad (22nd STOC, 1990)","journal-title":"SICOMP"},{"key":"3_CR13","first-page":"300","volume":"13","author":"G.L. Miller","year":"1976","unstructured":"Miller, G.L.: Riemann\u2019s Hypothesis and tests for primality. JCSS\u00a013, 300\u2013317 (1976)","journal-title":"JCSS"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal Hash Functions and their Cryptographic Applications. In: 21st STOC, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"issue":"1","key":"3_CR15","first-page":"43","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is Linear in Space. JCSS\u00a052(1), 43\u201352 (1996); Preliminary version in 25th STOC (1993)","journal-title":"JCSS"},{"key":"3_CR16","unstructured":"Rabin, M.O.: Digitalized Signatures and Public Key Functions as Intractable as Factoring. MIT\/LCS\/TR-212 (1979)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. Jour. of Number Theory\u00a012, 128\u2013138 (1980)","journal-title":"Jour. of Number Theory"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. CACM\u00a021, 120\u2013126 (1978)","journal-title":"CACM"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way Functions are Necessary and Sufficient for Secure Signatures. In: 22nd STOC, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R., Strassen, V.: A fast Monte-Carlo test for primality. SIAM Jour. on Computing\u00a06, 84\u201385 (1977)","journal-title":"SIAM Jour. on Computing"}],"container-title":["Lecture Notes in Computer Science","Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22670-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T13:01:44Z","timestamp":1560430904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22670-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226694","9783642226700"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22670-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}