{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:10:38Z","timestamp":1767625838389,"version":"3.41.2"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,11]]},"DOI":"10.1109\/tit.1983.1056754","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"877-894","source":"Crossref","is-referenced-by-count":26,"title":["Relativized cryptography"],"prefix":"10.1109","volume":"29","author":[{"given":"G.","family":"Brassard","sequence":"first","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/1008908.1008912"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1016\/0022-0000(81)90034-9"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/SFCS.1979.2"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/SFCS.1979.26"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/800070.802212"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/800135.804405"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/359460.359473"},{"year":"1960","author":"rabin","journal-title":"Degree of difficulty of computing a function and a partial ordering of recursive sets","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/SFCS.1978.23"},{"year":"1978","author":"bennett","journal-title":"private communication","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/S0022-0000(76)80043-8"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/321892.321895"},{"year":"1968","author":"wilkes","journal-title":"Time-Sharing Computer Systems","key":"ref17"},{"year":"1969","author":"knuth","journal-title":"The Art of Computer Programming Volume II Semi-Numerical Algorithms","key":"ref18"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref19"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/1008335.1008336"},{"year":"1977","journal-title":"Data Encrypton","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/800133.804363"},{"year":"1967","author":"kahn","journal-title":"The Codebreakers the story of secret writing","key":"ref3"},{"key":"ref6","first-page":"120","article-title":"On digital signatures and public-key cryptosystems","volume":"21","author":"rivest","year":"1978","journal-title":"Commun Ass Comput Mach"},{"year":"1967","author":"rogers","journal-title":"Theory of Recursive Functions and Effective Computability","key":"ref29"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.1976.1055638"},{"year":"1978","author":"mceliece","journal-title":"A public-key cryptosystem based on algebraic coding theory","key":"ref8"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIT.1978.1055927"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"year":"1978","author":"lempel","journal-title":"Cryptology in transition A survey","key":"ref9"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TIT.1979.1056010"},{"year":"1974","author":"aho","journal-title":"The Design and Analysis of Computer Algorithms","key":"ref22"},{"year":"1969","author":"hopcroft","journal-title":"Formal Languages and Their Relation to Automata","key":"ref21"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/S0022-0000(70)80006-X"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/SWAT.1974.20"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/800157.805047"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1137\/0204037"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22735\/01056754.pdf?arnumber=1056754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:40Z","timestamp":1753121260000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056754\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":34,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056754","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}