{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:41Z","timestamp":1778296661650,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3582,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0022-0000(03)00068-0","type":"journal-article","created":{"date-parts":[[2003,6,21]],"date-time":"2003-06-21T00:11:16Z","timestamp":1056154276000},"page":"608-622","source":"Crossref","is-referenced-by-count":13,"title":["One-way permutations and self-witnessing languages"],"prefix":"10.1016","volume":"67","author":[{"given":"Christopher M.","family":"Homan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayur","family":"Thakur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0022-0000(03)00068-0_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P=?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A,PA\u2260 NPA\u2260 coNPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB3","doi-asserted-by":"crossref","unstructured":"L. Berman, On the structure of complete sets, in: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, IEEE Computer Science Press, Silver Spring, MD, 1976, pp. 76\u201380.","DOI":"10.1109\/SFCS.1976.22"},{"key":"10.1016\/S0022-0000(03)00068-0_BIB4","unstructured":"L. Berman, Polynomial reducibilities and complete sets, Ph.D. Thesis, Cornell University, Ithaca, NY, 1977."},{"issue":"2","key":"10.1016\/S0022-0000(03)00068-0_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0022-0000(03)00068-0_BIB6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","article-title":"Tally languages and complexity classes","volume":"26","author":"Book","year":"1974","journal-title":"Inform. Control"},{"key":"10.1016\/S0022-0000(03)00068-0_BIB7","doi-asserted-by":"crossref","unstructured":"S. Fenner, L. Fortnow, A. Naik, J. Rogers, On inverting onto functions, in: Proceedings of the 11th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 213\u2013222.","DOI":"10.1109\/CCC.1996.507683"},{"issue":"3","key":"10.1016\/S0022-0000(03)00068-0_BIB8","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0220034","article-title":"Compression and ranking","volume":"20","author":"Goldberg","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB9","doi-asserted-by":"crossref","unstructured":"O. Goldreich, L. Levin, A hard-core predicate for any one-way function, in: Proceedings of the 21st ACM Symposium on Theory of Computing, ACM Press, New York, 1989, pp. 25\u201332.","DOI":"10.1145\/73007.73010"},{"issue":"3","key":"10.1016\/S0022-0000(03)00068-0_BIB10","first-page":"299","article-title":"Definability on finite structures and the existence of one-way functions","volume":"1","author":"Gr\u00e4del","year":"1994","journal-title":"Methods Logic Comput. Sci."},{"issue":"2","key":"10.1016\/S0022-0000(03)00068-0_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"10.1016\/S0022-0000(03)00068-0_BIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB13","unstructured":"L. Hemaspaandra, Personal Communication, October 2000."},{"issue":"1","key":"10.1016\/S0022-0000(03)00068-0_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1119","article-title":"Defying upward and downward separation","volume":"121","author":"Hemaspaandra","year":"1995","journal-title":"Inform. Comput."},{"issue":"1\u20132","key":"10.1016\/S0022-0000(03)00068-0_BIB15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0304-3975(00)00014-1","article-title":"Characterizing the existence of one-way permutations","volume":"244","author":"Hemaspaandra","year":"2000","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"10.1016\/S0022-0000(03)00068-0_BIB16","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/s002360050109","article-title":"Easy sets and hard certificate schemes","volume":"34","author":"Hemaspaandra","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB17","unstructured":"C. Homan, Low ambiguity in strong, total, associative, one-way functions, Technical Report TR734, Computer Science Department, University of Rochester, August 2000."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB18","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, S. Rudich, Limits on the provable consequences of one-way permutations, in: Proceedings of the 21st ACM Symposium on Theory of Computing, ACM Press, New York, 1989, pp. 44\u201361.","DOI":"10.1145\/73007.73012"},{"issue":"1","key":"10.1016\/S0022-0000(03)00068-0_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90085-4","article-title":"On some natural complete operators","volume":"37","author":"Ko","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0022-0000(03)00068-0_BIB20","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/0210061","article-title":"Completeness, approximation, and density","volume":"10","author":"Ko","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0022-0000(03)00068-0_BIB21","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579323","article-title":"One-way functions and pseudorandom number generators","volume":"7","author":"Levin","year":"1987","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/S0022-0000(03)00068-0_BIB22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(94)90123-6","article-title":"Upward separation for FewP and related classes","volume":"52","author":"Rao","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0022-0000(03)00068-0_BIB23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0020-0190(01)00269-1","article-title":"On characterizing the existence of partial one-way permutations","volume":"82","author":"Rothe","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB24","unstructured":"S. Rudich, Limits on the provable consequences of one-way functions, Ph.D. Thesis, University of California, Berkeley, November 1988."},{"issue":"3","key":"10.1016\/S0022-0000(03)00068-0_BIB25","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01374525","article-title":"A survey of one-way functions in complexity theory","volume":"25","author":"Selman","year":"1992","journal-title":"Math. Systems Theory"},{"issue":"1","key":"10.1016\/S0022-0000(03)00068-0_BIB26","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"The relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0022-0000(03)00068-0_BIB27","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0020-0190(88)90071-3","article-title":"On hardness of one-way functions","volume":"27","author":"Watanabe","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00068-0_BIB28","doi-asserted-by":"crossref","unstructured":"A. Yao, Theory and applications of trapdoor functions, in: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000680?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000680?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T23:23:48Z","timestamp":1734045828000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0022000003000680"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00068-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}