{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T09:05:45Z","timestamp":1781946345297,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540573401","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_15","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"215-227","source":"Crossref","is-referenced-by-count":24,"title":["Low communication 2-prover zero-knowledge proofs for NP"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uri","family":"Feige","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muli","family":"Safra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon, J. H. Spencer, The Probabilistic Method, John Wiley & Sons, New-York, 1992."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Szegedy and M. Sudan, Proof Verification and the Hardness of Approximations, Proc. 33rd IEEE Symp. on Foundation of Computer Science, 1992, to appear.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"15_CR3","unstructured":"S. Arora and M. Safra Probabilistic Checking of Proofs Proc. 33rd IEEE Symp. on Foundation of Computer Science, 1992, to appear."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"L. Babai, L. Fortnow, L. Levin and M. Szegedy Checking Computations in Polylogarithmic Time Proc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 21\u201331.","DOI":"10.1145\/103418.103428"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"L. Babai, L. Fortnow, C. Lund, Non-Deterministic. Exponential Time has Two-Prover Interactive Protocols, Proc. 31st IEEE Symp. on Foundation of Computer Science, 1990, pp. 16\u201325.","DOI":"10.1109\/FSCS.1990.89520"},{"key":"15_CR6","first-page":"150","volume":"38","author":"D. A. Barrington","year":"1989","unstructured":"D. A. Barrington, Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC 1, JCSS (38), 1989, pp. 150\u2013164.","journal-title":"JCSS"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"M. Ben-or, S. Goldwasser, J. Kilian, A. Wigderson, Multi Prover Interactive Proofs: How to Remove Intractability, Proc. 20th ACM Symposium on Theory of Computing, 1988, pp. 113\u2013131.","DOI":"10.1145\/62212.62223"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"J. Cai, A. Condon, R. Lipton, On Bounded Round Multi-Prover Interactive Proof Systems, Proc. of Structure in Complexity, 1990, pp. 45\u201354.","DOI":"10.1109\/SCT.1990.113953"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"J. Cai, A. Condon, R. Lipton, Playing Games of Incomplete Information, STACS 1990.","DOI":"10.1007\/3-540-52282-4_32"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"J. Cai, A. Condon, R. Lipton, PSPACE is Provable by Two Provers in One Round, Proc. Structure in Complexity, 1991, pp. 110\u2013115.","DOI":"10.1109\/SCT.1991.160250"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"U. Feige, On the Success Probability of the Two Provers in One Round Proof Systems, Proc. Structure in Complexity, 1991, pp. 116\u2013123.","DOI":"10.1109\/SCT.1991.160251"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"U. Feige, S. Goldwasser, L. Lovasz, M. Safra, M. Szegedy, \u201cApproximating Clique is Almost NP-Complete\u201d, Proc. 32nd IEEE Symp. on Foundation of Computer Science, 1991, pp. 2\u201312.","DOI":"10.1109\/SFCS.1991.185341"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"U. Feige and L. Lovasz, Two-Provers One Round Proof Systems: Their Power and Their Problems, Proc. 24th ACM Symposium on Theory of Computing, 1992","DOI":"10.1145\/129712.129783"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"L. Fortnow, J. Rompel, M. Sipser, On the Power of Multi-Prover Interactive Protocols, Proc. of Structure in Complexity 1988, pp. 156\u2013161. Erratum in Proc. Structure in Complexity, 1990, pp. 318\u2013319.","DOI":"10.1109\/SCT.1988.5275"},{"key":"15_CR15","unstructured":"J. Kilian, Use of Randomness in Algorithms and Protocols, MIT Press, 1990."},{"key":"15_CR16","unstructured":"J. Kilian, Strong Separation Models of Multi Prover Interactive Proofs, DIMACS Workshop on Cryptography, October 1990."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"J. Kilian, A Note on Efficient Zero-Knowledge Proofs and Arguments, Proc. 24th ACM Symposium on Theory of Computing, 1992","DOI":"10.1145\/129712.129782"},{"key":"15_CR18","unstructured":"D. Lapidot, A. Shamir, A One-Round, Two-Prover, Zero-Knowledge Protocol for NP, Crypto\u201991 abstracts."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"D. Lapidot, A. Shamir, Fully Parallelized Multi Prover Protocols for NEXP-time Proc. 32nd IEEE Symp. on Foundation of Computer Science, 1991, pp. 13\u201318.","DOI":"10.1109\/SFCS.1991.185342"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:19:52Z","timestamp":1737346792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_15","relation":{},"subject":[]}}