{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:39Z","timestamp":1759638219741,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195709"},{"type":"electronic","value":"9783642195716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_36","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"597-614","source":"Crossref","is-referenced-by-count":15,"title":["On Black-Box Separations among Injective One-Way Functions"],"prefix":"10.1007","author":[{"given":"Takahiro","family":"Matsuda","sequence":"first","affiliation":[]},{"given":"Kanta","family":"Matsuura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Blum, M., Impabliazzo, R.: Generic oracles and oracle classes (extended abstract). In: FOCS 1987, pp. 118\u2013126 (1987)","key":"36_CR1","DOI":"10.1109\/SFCS.1987.30"},{"issue":"4","key":"36_CR2","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. Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"36_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00145-005-0317-1","volume":"19","author":"Y.-C. Chang","year":"2006","unstructured":"Chang, Y.-C., Hsiao, C.-Y., Lu, C.-J.: The impossibility of basing one-way permutations on central cryptographic primitives. J. of Cryptology\u00a019(1), 97\u2013114 (2006)","journal-title":"J. of Cryptology"},{"issue":"4","key":"36_CR4","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"29","key":"36_CR5","first-page":"1","volume":"2","author":"O. Goldreich","year":"1995","unstructured":"Goldreich, O., Levin, L.A., Nisan, N.: On constructing 1-1 one-way functions. Electronic Colloquium on Computational Complexity (ECCC)\u00a02(29), 1\u20131 (1995)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0304-3975(91)90323-T","volume":"81","author":"J. Hartmanis","year":"1991","unstructured":"Hartmanis, J., Hemachandra, L.A.: One-way functions and the nonisomorphism of NP-complete sets. Theor. Comput. Sci.\u00a081(1), 155\u2013183 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L., Luby, M.: Construction of a pseudorandom generator from any one-way function. SIAM J. Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Computing"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-28628-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C.-Y. Hsiao","year":"2004","unstructured":"Hsiao, C.-Y., Reyzin, L.: Finding collisions on a public road, or do secure hash functions need secret coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 92\u2013105. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC 1989, pp. 44\u201361 (1989)","key":"36_CR9","DOI":"10.1145\/73007.73012"},{"doi-asserted-by":"crossref","unstructured":"Kahn, J., Saks, M., Smyth, C.: A dual version of Reimer\u2019s inequality and a proof of Rudich\u2019s conjecture. In: CoCo 2000, pp. 98\u2013103 (2000)","key":"36_CR10","DOI":"10.1109\/CCC.2000.856739"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-85174-5_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"O. Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Vaikuntanathan, V.: Adaptive one-way functions and applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 57\u201374. Springer, Heidelberg (2008)"},{"unstructured":"Reingold, O.: On black-box separations in cryptography (2006), One of Tutorials in TCC 2006 (2006), A slide file, http:\/\/research.ihost.com\/tcc06\/slides\/Reingold-tutorial.ppt","key":"36_CR12"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"unstructured":"Rudich, S.: Limits on the provable consequences of one-way functions. PhD thesis, University of California at Berkeley (1988)","key":"36_CR14"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"Simon, D.R.: Findings collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"issue":"4","key":"36_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02125350","volume":"9","author":"G. Tardos","year":"1989","unstructured":"Tardos, G.: Query complexity, or why is it difficult to separate NP A \u2009\u222a\u2009coNP A from P A by random oracles A? Combinatorica\u00a09(4), 385\u2013392 (1989)","journal-title":"Combinatorica"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-11799-2_11","volume-title":"Theory of Cryptography","author":"Y. Vahlis","year":"2010","unstructured":"Vahlis, Y.: Two is a crowd? a black-box separation of one-wayness and security under correlated inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 165\u2013182. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: FOCS 1982, pp. 80\u201391 (1982)","key":"36_CR18","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:56:49Z","timestamp":1741107409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}