{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:40:38Z","timestamp":1774600838872,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8751,"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":[[1989,8]]},"DOI":"10.1016\/0022-0000(89)90018-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"21-50","source":"Crossref","is-referenced-by-count":122,"title":["On hiding information from an oracle"],"prefix":"10.1016","volume":"39","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joan","family":"Feigenbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90018-4_BIB1","series-title":"Proceedings, 5th STACS","first-page":"264","article-title":"A simple protocol for secure circuit evaluation","author":"Abadi","year":"1988"},{"key":"10.1016\/0022-0000(89)90018-4_BIB2","series-title":"Proceedings, 19th STOC","first-page":"195","article-title":"On hiding information from an oracle","author":"Abadi","year":"1987"},{"key":"10.1016\/0022-0000(89)90018-4_BIB3","article-title":"Provable security of cryptosystems: A survey","author":"Angluin","year":"1983","journal-title":"YALEU\/DCS\/TR-288"},{"key":"10.1016\/0022-0000(89)90018-4_BIB4","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/5925.5937","article-title":"The polynomial-time hierarchy and sparse oracles","volume":"33","author":"Balc\u00e1zar","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90018-4_BIB5","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","article-title":"Minimum disclosure proofs of knowledge","volume":"37","author":"Brassard","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90018-4_BIB6","article-title":"Hiding Information from Several Oracles","author":"Beaver","year":"1989","journal-title":"Harvard University TR-10-89"},{"key":"10.1016\/0022-0000(89)90018-4_BIB7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","article-title":"Does CoNP have short interactive proofs?","volume":"25","author":"Boppana","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(89)90018-4_BIB8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0213030","article-title":"Quantitative relativizations of complexity classes","volume":"13","author":"Book","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90018-4_BIB9","series-title":"Proceedings, Symposium on Security and Privacy","first-page":"116","article-title":"A database encryption scheme which allows the computation of statistics using encrypted data","author":"Blackley","year":"1985"},{"key":"10.1016\/0022-0000(89)90018-4_BIB10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of hypothesis based on the sum of the observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/0022-0000(89)90018-4_BIB11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90018-4_BIB12","series-title":"Proceedings, CRYPTO'85","first-page":"477","article-title":"Encrypting problem instances, or, \u2026, Can you take advantage of someone without having to trust him?","author":"Feigenbaum","year":"1986"},{"key":"10.1016\/0022-0000(89)90018-4_BIB13","series-title":"Proceedings, 19th STOC","first-page":"204","article-title":"The complexity of perfect zero-knowledge","author":"Fortnow","year":"1987"},{"key":"10.1016\/0022-0000(89)90018-4_BIB14","series-title":"Proceedings, 26th FOCS","first-page":"360","article-title":"A private interactive test of a Boolean predicate and minimum-knowledge public-key cryptosystems","author":"Galil","year":"1985"},{"key":"10.1016\/0022-0000(89)90018-4_BIB15","series-title":"Proceedings, CRYPTO '87","first-page":"135","article-title":"Cryptographic computation: Secure fault-tolerant protocols in the public-key model","author":"Galil","year":"1988"},{"key":"10.1016\/0022-0000(89)90018-4_BIB16","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(89)90018-4_BIB17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The knowledge complexity of interactive proof systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90018-4_BIB18","series-title":"Proceedings, 27th FOCS","first-page":"174","article-title":"Proofs that yield nothing but the validity of the assertion, and a methodology of cryptographic protocol design","author":"Goldreich","year":"1986"},{"key":"10.1016\/0022-0000(89)90018-4_BIB19","series-title":"Introduction to Probability Theory","author":"Hoel","year":"1971"},{"key":"10.1016\/0022-0000(89)90018-4_BIB20","volume":"Vol. 1","author":"Knuth","year":"1973"},{"issue":"Nos 3\u20134","key":"10.1016\/0022-0000(89)90018-4_BIB21","first-page":"191","article-title":"Turing Machines that take advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/0022-0000(89)90018-4_BIB22","unstructured":"N. Nisan, in preparation."},{"key":"10.1016\/0022-0000(89)90018-4_BIB23","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1972"},{"key":"10.1016\/0022-0000(89)90018-4_BIB24","series-title":"Proceedings, 20th FOCS","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0022-0000(89)90018-4_BIB25","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90018-4_BIB26","series-title":"Foundations of Secure Computation","first-page":"168","article-title":"On databanks and privacy homomorphisms","author":"Rivest","year":"1978"},{"key":"10.1016\/0022-0000(89)90018-4_BIB27","series-title":"Complexity and Structure","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0022-0000(89)90018-4_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90018-4_BIB29","series-title":"Proceedings, 28th FOCS","first-page":"472","article-title":"Random-self-reducibility and zero-knowledge interactive proofs of possession of information","author":"Tompa","year":"1987"},{"key":"10.1016\/0022-0000(89)90018-4_BIB30","series-title":"Proceedings, 23rd FOCS","first-page":"160","article-title":"Protocols for secure computations","author":"Yao","year":"1982"},{"key":"10.1016\/0022-0000(89)90018-4_BIB31","series-title":"Proceedings, 27th FOCS","first-page":"162","article-title":"How to generate and exchange secrets","author":"Yao","year":"1986"},{"key":"10.1016\/0022-0000(89)90018-4_BIB32","series-title":"Workshop on Communication and Computing","article-title":"Intrinsically indiscreet problems","author":"Yao","year":"1986"},{"key":"10.1016\/0022-0000(89)90018-4_BIB33","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","article-title":"Some consequences of non-uniform conditions on uniform classes","volume":"26","author":"Yap","year":"1983","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:08Z","timestamp":1550325308000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0022000089900184"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90018-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}