{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:22Z","timestamp":1725488602794},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_17","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:32:26Z","timestamp":1186727546000},"page":"162-171","source":"Crossref","is-referenced-by-count":5,"title":["If P \u2260 NP then Some Strongly Noninvertible Functions Are Invertible"],"prefix":"10.1007","author":[{"given":"Lane A.","family":"Hemaspaandra","sequence":"first","affiliation":[]},{"given":"Kari","family":"Pasanen","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"17_CR1","unstructured":"D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993."},{"key":"17_CR2","unstructured":"J. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity I. EATCS Texts in Theoretical Computer Science. Springer-Verlag, second edition, 1995."},{"key":"17_CR3","series-title":"PhD thesis","volume-title":"Polynomial Reducibilities and Complete Sets","author":"L. Berman","year":"1977","unstructured":"L. Berman. Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University, Ithaca, NY, 1977."},{"issue":"4","key":"17_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/337885.337891","volume":"30","author":"A. Beygelzimer","year":"1999","unstructured":"A. Beygelzimer, L. Hemaspaandra, C. Homan, and J. Rothe. One-way functions in worst-case cryptography: Algebraic and security properties are on the house. SIGACT News, 30(4):25\u201340, December 1999.","journal-title":"SIGACT News"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17(2):309\u2013335, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR6","volume-title":"Technical Report TR-734","author":"C. Homan","year":"2000","unstructured":"C. Homan. Low ambiguity in strong, total, associative, one-way functions. Technical Report TR-734, University of Rochester, Department of Computer Science, Rochester, NY, August 2000."},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1006\/jcss.1998.1613","volume":"58","author":"L. Hemaspaandra","year":"1999","unstructured":"L. Hemaspaandra and J. Rothe. Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory. Journal of Computer and System Sciences, 58(3):648\u2013659, 1999.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(85)90085-4","volume":"37","author":"K. Ko","year":"1985","unstructured":"K. Ko. On some natural complete operators. Theoretical Computer Science, 37(1):1\u201330, 1985.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00206323","volume":"1","author":"B. Kaliski Jr.","year":"1988","unstructured":"B. Kaliski Jr., R. Rivest, and A. Sherman. Is the data encryption standard a group? (Results of cycling experiments on DES). Journal of Cryptology, 1(1):3\u201336, 1988.","journal-title":"Journal of Cryptology"},{"key":"17_CR10","unstructured":"C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"17_CR11","volume-title":"Technical Report CS-TR-3183\/UMIACS-TR-93-124","author":"M. Rabi","year":"1993","unstructured":"M. Rabi and A. Sherman. Associative one-way functions: A new paradigm for secret-key agreement and digital signatures. Technical Report CS-TR-3183\/UMIACS-TR-93-124, Department of Computer Science, University of Maryland, College Park, Maryland, 1993."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0020-0190(97)00186-5","volume":"64","author":"M. Rabi","year":"1997","unstructured":"M. Rabi and A. Sherman. An observation on associative one-way functions in complexity theory. Information Processing Letters, 64(2):239\u2013244, 1997.","journal-title":"Information Processing Letters"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01374525","volume":"25","author":"A. Selman","year":"1992","unstructured":"A. Selman. A survey of one-way functions in complexity theory. Mathematical Systems Theory, 25(3):203\u2013221, 1992.","journal-title":"Mathematical Systems Theory"},{"key":"17_CR14","volume-title":"Cryptology and VLSI (a Two-Part Dissertation)","author":"A. Sherman","year":"1986","unstructured":"A. Sherman. Cryptology and VLSI (a Two-Part Dissertation). PhD thesis, MIT, Cambridge, MA, 1986. Available as Technical Report MIT\/LCS\/TR-381."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T04:28:03Z","timestamp":1550723283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}