{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:18:11Z","timestamp":1725488291150},"publisher-location":"New York, NY","reference-count":9,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387971964"},{"type":"electronic","value":"9780387347998"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/0-387-34799-2_6","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:17:36Z","timestamp":1186363056000},"page":"71-75","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Zero-Knowledge With Finite State Verifiers"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Stockmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"unstructured":"L. Babai, Trading group theory for randomness, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 421\u2013429.","key":"6_CR1"},{"key":"6_CR2","series-title":"Tech. Report","volume-title":"Computational models of games","author":"A. Condon","year":"1987","unstructured":"A. Condon, Computational models of games, Ph.D. Thesis, Tech. Report 87-04-04, Computer Science Dept., University of Washington, Seattle, WA, 1987."},{"key":"6_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-16486-3_95","volume-title":"Proc. Conference on Structure in Complexity Theory","author":"A. Condon","year":"1986","unstructured":"A. Condon and R. Ladner, Probabilistic game automata, Proc. Conference on Structure in Complexity Theory, Lecture Notes in Computer Science, Vol. 223, Springer-Verlag, New York, 1986, pp. 144\u2013162."},{"unstructured":"C. Dwork and L. Stockmeyer, Interactive proof systems with finite state verifiers (preliminary report), IBM Research Report RJ 6262 (1988).","key":"6_CR4"},{"key":"6_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-10856-4_72","volume-title":"Proc. International Symposium on Mathematical Foundations of Computer Science","author":"R. Freivalds","year":"1981","unstructured":"R. Freivalds, Probabilistic two-way machines, Proc. International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 118, Springer-Verlag, New York, 1981, pp. 33\u201345."},{"unstructured":"O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proc. 27th IEEE Symp. on Foundations of Computer Science (1986), pp. 174\u2013187.","key":"6_CR6"},{"unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 291\u2013304.","key":"6_CR7"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0022-0000(86)90045-0","volume":"33","author":"A. G. Greenberg","year":"1986","unstructured":"A. G. Greenberg and A. Weiss, A lower bound for probabilistic algorithms for finite state machines, J. Comput. Syst. Sci. 33 (1986), pp. 88\u2013105.","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"J. Kilian, Zero-knowledge with log-space verifiers, Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), to appear.","key":"6_CR9","DOI":"10.1109\/SFCS.1988.21918"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34799-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T15:25:54Z","timestamp":1576164354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34799-2_6"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780387971964","9780387347998"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/0-387-34799-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"1 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}