{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:49:51Z","timestamp":1672346991582},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1007\/bf02088290","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T20:34:03Z","timestamp":1124051643000},"page":"21-35","source":"Crossref","is-referenced-by-count":4,"title":["Absolute results concerning one-way functions and their applications"],"prefix":"10.1007","volume":"22","author":[{"given":"Steven","family":"Homer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02088290_CR1","series-title":"Technical Report","volume-title":"An observation concerning the complexity of problems with few solutions and its applications to cryptography","author":"S. Even","year":"1980","unstructured":"S. Even and Y. Yacobi, An observation concerning the complexity of problems with few solutions and its applications to cryptography. Technical Report No. 197, The Technion, Computer Science Department, Technion, Haifa, 1980."},{"issue":"2","key":"BF02088290_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"61","author":"S. Fven","year":"1984","unstructured":"S. Fven, A. L. Selman, and Y. Yacobi, The complexity of promise problems with applications to public-key cryptography,Inform. and Control,61(2) (1984), 159\u2013173.","journal-title":"Inform. and Control"},{"key":"BF02088290_CR3","doi-asserted-by":"crossref","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 J. Comput.,17 (1988), 309\u2013335.","journal-title":"SIAM J. Comput."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02088290.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02088290\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02088290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T10:05:03Z","timestamp":1557828303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02088290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["BF02088290"],"URL":"https:\/\/doi.org\/10.1007\/bf02088290","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}