{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T23:51:32Z","timestamp":1776210692462,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0020-0190(98)00116-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"205-214","source":"Crossref","is-referenced-by-count":65,"title":["On the complexity of interactive proofs with bounded communication"],"prefix":"10.1016","volume":"67","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00116-1_BIB1","series-title":"17th STOC","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB2","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","article-title":"Arthur-Merlin games: a randomized proof system and a hierarchy of complexity classes","volume":"36","author":"Babai","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00116-1_BIB3","series-title":"Uniform Generation of NP-witnesses using an NP-oracle","author":"Bellare","year":"1997"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB4","series-title":"24th STOC","first-page":"711","article-title":"Making zero-knowledge provers efficient","author":"Bellare","year":"1992"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB5","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\/S0020-0190(98)00116-1_BIB6_1","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","article-title":"Minimum disclosure proofs of knowledge","author":"Brassard","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00116-1_BIB6_2","author":"Brassard","year":"1986","journal-title":"27th FOCS"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB7","series-title":"Advances in Computing Research: A Research Annual","first-page":"327","article-title":"The complexity of perfect zero-knowledge","volume":"Vol. 5","author":"Fortnow","year":"1989"},{"issue":"1","key":"10.1016\/S0020-0190(98)00116-1_BIB8_1","first-page":"691","article-title":"Proofs that yield nothing but their validity or all languages in NP have zeroknowledge proof systems","volume":"38","author":"Goldreich","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB8_2","author":"Goldreich","year":"1986","journal-title":"27th FOCS"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB9_1","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\/S0020-0190(98)00116-1_BIB9_2","author":"Goldwasser","year":"1985","journal-title":"17th STOC"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00116-1_BIB11","series-title":"24th STOC","first-page":"723","article-title":"A note on efficient zero-knowledge proofs and arguments","author":"Kilian","year":"1992"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB12","series-title":"15th STOC","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/S0020-0190(98)00116-1_BIB13","series-title":"15th STOC","first-page":"118","article-title":"The complexity of approximate counting","author":"Stockmeyer","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001161?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001161?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:28:23Z","timestamp":1556058503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0020019098001161"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00116-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}