{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:03:12Z","timestamp":1775282592628,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":8082,"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":[[1991,6]]},"DOI":"10.1016\/0022-0000(91)90006-q","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"327-345","source":"Crossref","is-referenced-by-count":88,"title":["Statistical zero-knowledge languages can be recognized in two rounds"],"prefix":"10.1016","volume":"42","author":[{"given":"William","family":"Aiello","sequence":"first","affiliation":[]},{"given":"Johan","family":"Hastad","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(91)90006-Q_BIB1","doi-asserted-by":"crossref","unstructured":"W. AIELLO, S. GOLDWASSER, AND J. HASTAD, On the Power of Interaction, Combinatorica, to appear.","DOI":"10.1007\/BF02122692"},{"key":"10.1016\/0022-0000(91)90006-Q_BIB2","series-title":"Proc. of 17th Symposium on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/0022-0000(91)90006-Q_BIB3","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."},{"issue":"No.2","key":"10.1016\/0022-0000(91)90006-Q_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\/0022-0000(91)90006-Q_BIB5","series-title":"Proc. of CRYPTO '88","article-title":"Everything provable is provable in zero-knowledge","author":"Ben Or","year":"1988"},{"key":"10.1016\/0022-0000(91)90006-Q_BIB6","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(91)90006-Q_BIB7","series-title":"Proc. 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\/0022-0000(91)90006-Q_BIB8","series-title":"Proc. of 17th Symposium on Theory of Computing","first-page":"291","article-title":"The knowledge complexity of interactive proofs","author":"Goldwasser","year":"1985"},{"issue":"No. 1","key":"10.1016\/0022-0000(91)90006-Q_BIB9","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 J. Comput."},{"key":"10.1016\/0022-0000(91)90006-Q_BIB10","series-title":"Proc. of 28th Symposium on Foundations of Computer Science","first-page":"449","article-title":"Interactive proof systems: Provers that never fail and random selection","author":"Goldreich","year":"1987"},{"key":"10.1016\/0022-0000(91)90006-Q_BIB11","series-title":"Proc. of 27th Symposium on Foundations of Computer Science","first-page":"174","article-title":"Proofs that yield nothing but their validity and a methodology of cryptographic protocol design","author":"Goldreich","year":"1986"},{"key":"10.1016\/0022-0000(91)90006-Q_BIB12","series-title":"Proc. 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\/0022-0000(91)90006-Q_BIB13","series-title":"Proc. of CRYPTO '87","first-page":"40","article-title":"Direct minimum-knowledge computations","author":"Impagliazzo","year":"1987"},{"key":"10.1016\/0022-0000(91)90006-Q_BIB14","series-title":"Proc. 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\/0022-0000(91)90006-Q_BIB15","series-title":"Proc. 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"},{"key":"10.1016\/0022-0000(91)90006-Q_BIB16","series-title":"Proc. of 15th Symposium on Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190006Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190006Q?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:18Z","timestamp":1550325378000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009190006Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["002200009190006Q"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(91)90006-q","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}