{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:06:40Z","timestamp":1763467600006},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"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":[[1992,4]]},"DOI":"10.1016\/0022-0000(92)90021-a","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"259-271","source":"Crossref","is-referenced-by-count":10,"title":["Multi-oracle interactive protocols with constant space verifiers"],"prefix":"10.1016","volume":"44","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90021-A_BIB1","series-title":"Proceedings, 17th Annual ACM Symp. on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/0022-0000(92)90021-A_BIB2","series-title":"Proceedings, 31st Annual IEEE Symp. on Foundations of Computer Science","first-page":"16","article-title":"Non-deterministic exponential time has two-prover interactive protocols","author":"Babai","year":"1990"},{"key":"10.1016\/0022-0000(92)90021-A_BIB3","series-title":"Proceedings, 20th Annual ACM Symp. on Theory of Computing","first-page":"113","article-title":"Multi prover interactive proofs: How to remove intractability","author":"Ben-or","year":"1988"},{"key":"10.1016\/0022-0000(92)90021-A_BIB4","series-title":"Computational Models of Games","author":"Condon","year":"1989"},{"key":"10.1016\/0022-0000(92)90021-A_BIB5","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/0022-0000(88)90038-4","article-title":"Probabilistic game automata","volume":"36","author":"Condon","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90021-A_BIB6","series-title":"Proceedings, 29th Annual IEEE Symp. on Foundations of Computer Science","first-page":"462","article-title":"On the complexity of space bounded interactive proofs","author":"Condon","year":"1989"},{"key":"10.1016\/0022-0000(92)90021-A_BIB7","series-title":"Advances in Cryptology\u2014C RYPTO '88 Proceedings","first-page":"71","article-title":"Zero-knowledge with finite state verifiers","volume":"Vol. 403","author":"Dwork","year":"1988"},{"key":"10.1016\/0022-0000(92)90021-A_BIB8","series-title":"Advances in Cryptology-CRYPTO '88 Proceedings","first-page":"284","article-title":"The noisy oracle problem","volume":"Vol. 403","author":"Feige","year":"1988"},{"key":"10.1016\/0022-0000(92)90021-A_BIB9","unstructured":"L. FORTNOW, \u201cComplexity-Theoretic Aspects of Interactive Proof Systems,\u201d Ph.D. thesis, MIT\/LCS\/TR-447, MIT."},{"issue":"No 1","key":"10.1016\/0022-0000(92)90021-A_BIB10","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(92)90021-A_BIB11","series-title":"Randomness and Computation","first-page":"73","article-title":"Private Coins versus Public Coins in Interactive Proof Systems","volume":"Vol. 5","author":"Goldwasser","year":"1989"},{"key":"10.1016\/0022-0000(92)90021-A_BIB12","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(92)90021-A_BIB13","series-title":"Proceedings, 29th Annual IEEE Symp. on Foundations of Computer Science","first-page":"25","article-title":"Zero-knowledge with log-space verifiers","author":"Kilian","year":"1988"},{"key":"10.1016\/0022-0000(92)90021-A_BIB14","unstructured":"R. LIPTON, \u201cRecursively Enumerable Languages have Finite State Interactive Proofs,\u201d Technical Report CS-TR-213-89, Princeton University."},{"key":"10.1016\/0022-0000(92)90021-A_BIB15","series-title":"Proceedings, 20th Annual IEEE Symp. on Foundations of Computer Science","first-page":"348","article-title":"Multiple-person alternation","author":"Peterson","year":"1979"},{"key":"10.1016\/0022-0000(92)90021-A_BIB16","series-title":"Proceedings, 11th ACM Symp. on Theory of Computing","first-page":"288","article-title":"Universal two person games of incomplete information","author":"Reif","year":"1979"},{"key":"10.1016\/0022-0000(92)90021-A_BIB17","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","article-title":"The complexity of two-player games of incomplete information","volume":"29","author":"Reif","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90021-A_BIB18","unstructured":"J. ROMPEL, personal communication; in [13]."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290021A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290021A?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:56:59Z","timestamp":1550325419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290021A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002200009290021A"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90021-a","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}