{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:18:57Z","timestamp":1648973937561},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":8021,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1016\/0890-5401(91)90024-v","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"223-240","source":"Crossref","is-referenced-by-count":5,"title":["Relativized perfect zero knowledge is not BPP"],"prefix":"10.1016","volume":"93","author":[{"given":"William","family":"Aiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Hastad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90024-V_BIB1","series-title":"Proceedings of 27th Symposium on Foundations of Computer Science","first-page":"368","article-title":"On the power of interaction, Combinatorica","author":"Aiello","year":"1986"},{"key":"10.1016\/0890-5401(91)90024-V_BIB15_1","doi-asserted-by":"crossref","unstructured":"Aiello, W. and Hastad, J. (to appear), Statistical zero-knowledge languages can be recognized in two rounds, J. Comput. System Sci.","DOI":"10.1016\/0022-0000(91)90006-Q"},{"key":"10.1016\/0890-5401(91)90024-V_BIB15_2","series-title":"Proceedings of 28th Symposium on Foundations of Computer Science","first-page":"439","author":"Aiello","year":"1987"},{"key":"10.1016\/0890-5401(91)90024-V_BIB2","series-title":"Proceedings of 17th Symposium on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/0890-5401(91)90024-V_BIB3","series-title":"Proceedings of Crypto 1988","article-title":"Evevything provable is provable in zero-knowledge","author":"Ben Or","year":"1988"},{"key":"10.1016\/0890-5401(91)90024-V_BIB4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","article-title":"Does co-NP have short interactive proofs?","volume":"25","author":"Boppana","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90024-V_BIB5","series-title":"Proceedings of 19th Symposium on Theory of Computing","first-page":"204","article-title":"The complexity of perfect zero-knowledge","author":"Fortnow","year":"1987"},{"key":"10.1016\/0890-5401(91)90024-V_BIB6","series-title":"The polynomial time hierarchy has interactive proofs","author":"Fortnow","year":"1989"},{"key":"10.1016\/0890-5401(91)90024-V_BIB7","author":"Goldreich","year":"1989"},{"key":"10.1016\/0890-5401(91)90024-V_BIB8","series-title":"Proceedings of 27th Symposium on Foundations of Computer Science","first-page":"174","article-title":"Proofs that yield noting but their validity and a methodology of cryptographic protocol design","author":"Goldreich","year":"1986"},{"key":"10.1016\/0890-5401(91)90024-V_BIB9","series-title":"Proceedings of 17th Symposium on Theory of Computing","first-page":"291","article-title":"The knowledge complexity of interactive proofs","author":"Goldwasser","year":"1985"},{"key":"10.1016\/0890-5401(91)90024-V_BIB10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"Proofs, knowledge, and computation","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/0890-5401(91)90024-V_BIB11","series-title":"Proceedings of 18th Symposium on Theory of Computing","first-page":"59","article-title":"Private coins versus public coins in interactive proof systems","author":"Goldwasser","year":"1986"},{"key":"10.1016\/0890-5401(91)90024-V_BIB12","series-title":"Proceedings of CRYPTO 1987","first-page":"40","article-title":"Direct minimum-knowledge computations","author":"Impagliazzo","year":"1987"},{"key":"10.1016\/0890-5401(91)90024-V_BIB13","series-title":"Proceedings of 28th Symposium on Foundations of Computer Science","first-page":"462","article-title":"On the cunning powers of cheating verifiers: Some observations about zero-knowledge proofs","author":"Oren","year":"1987"},{"key":"10.1016\/0890-5401(91)90024-V_BIB16","unstructured":"Shamir, Adi (1989), IP = PSPACE, manuscript."},{"key":"10.1016\/0890-5401(91)90024-V_BIB14","series-title":"Proceedings of 28th Symposium on Foundations of Computer Science","first-page":"472","article-title":"Random self-reducibility and zero-knowledge interactive proofs of possession of information","author":"Tompa","year":"1987"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190024V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190024V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:38Z","timestamp":1548897938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190024V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["089054019190024V"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90024-v","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}