{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:37Z","timestamp":1778296657419,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00269-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"165-171","source":"Crossref","is-referenced-by-count":10,"title":["On characterizing the existence of partial one-way permutations"],"prefix":"10.1016","volume":"82","author":[{"given":"J\u00f6rg","family":"Rothe","sequence":"first","affiliation":[]},{"given":"Lane A.","family":"Hemaspaandra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00269-1_BIB001","series-title":"Proceedings of the 1st Structure in Complexity Theory Conference","first-page":"1","article-title":"The complexity of sparse sets in P","volume":"223","author":"Allender","year":"1986"},{"issue":"6","key":"10.1016\/S0020-0190(01)00269-1_BIB002","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1137\/0217075","article-title":"P-printable sets","volume":"17","author":"Allender","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00269-1_BIB003","series-title":"Some comments on functional self-reducibility and the NP hierarchy, Technical Report TR 76-284","author":"Borodin","year":"1976"},{"issue":"7","key":"10.1016\/S0020-0190(01)00269-1_BIB004","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s000370050008","article-title":"Sperner's lemma and robust machines","volume":"2","author":"Crescenzi","year":"1998","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0020-0190(01)00269-1_BIB005","series-title":"Proceedings of the 11th Annual IEEE Conference on Computational Complexity","first-page":"213","article-title":"Inverting onto functions","author":"Fenner","year":"1996"},{"key":"10.1016\/S0020-0190(01)00269-1_BIB006","unstructured":"L. Fortnow, Personal communication, December 10, 1997"},{"key":"10.1016\/S0020-0190(01)00269-1_BIB007","series-title":"Proceedings of the 5th International Symposium on Algorithms and Computation","first-page":"396","article-title":"Separability and one-way functions","volume":"834","author":"Fortnow","year":"1994"},{"key":"10.1016\/S0020-0190(01)00269-1_BIB008","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 of Logic in Comput. Sci."},{"issue":"2","key":"10.1016\/S0020-0190(01)00269-1_BIB009","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\/S0020-0190(01)00269-1_BIB010","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines: On complete languages for UP","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0020-0190(01)00269-1_BIB011","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0304-3975(94)90137-6","article-title":"Quasi-injective reductions","volume":"123","author":"Hemaspaandra","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0020-0190(01)00269-1_BIB012","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1006\/jcss.1998.1613","article-title":"Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory","volume":"58","author":"Hemaspaandra","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00269-1_BIB013","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 (1\u20132)","author":"Hemaspaandra","year":"2000","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"10.1016\/S0020-0190(01)00269-1_BIB014","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\/S0020-0190(01)00269-1_BIB015","series-title":"Proceedings of the 3rd Structure in Complexity Theory Conference","first-page":"29","article-title":"Decision trees and downward closures","author":"Impagliazzo","year":"1988"},{"issue":"3","key":"10.1016\/S0020-0190(01)00269-1_BIB016","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\/S0020-0190(01)00269-1_BIB017","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\/S0020-0190(01)00269-1_BIB018","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."},{"issue":"3","key":"10.1016\/S0020-0190(01)00269-1_BIB019","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/0022-0000(92)90015-B","article-title":"On polynomial-time one-truth-table reducibility to a sparse set","volume":"44","author":"Watanabe","year":"1992","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002691?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002691?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T01:52:34Z","timestamp":1556761954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002691"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00269-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}