{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T05:10:40Z","timestamp":1735017040909,"version":"3.32.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01200756","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:13:34Z","timestamp":1108728814000},"page":"203-214","source":"Crossref","is-referenced-by-count":12,"title":["A one-round, two-prover, zero-knowledge protocol for NP"],"prefix":"10.1007","volume":"15","author":[{"given":"Dror","family":"Lapidot","sequence":"first","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"N. Alon: Private communication, 1990."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Crepeau, M. Yung:Everything in NP can be argued in perfect zero knowledge in a bounded number of rounds, Proc. of 16th International Colloquium on Automata, Languages and Programming (ICALP) 1989.","DOI":"10.1007\/BFb0035756"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, andO. Goldreich:On Defining Proofs of Knowledge, Proc. of Crypto, 390?420, 1992.","DOI":"10.1007\/3-540-48071-4_28"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, andA. Wigderson:Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions, Proc. 20th ACM Symposium on Theory of Computing, 113?131, 1988.","DOI":"10.1145\/62212.62223"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"R. Boppana, J. Hastad andS. Zachos: Does co-NP Have Short Interactive Proofs?,Inform. Process. Lett.,25 (1987), 127?132.","journal-title":"Inform. Process. Lett."},{"key":"CR6","unstructured":"M. Bellare, S. Micali andR. Ostrovsky:Perfect Zero-Knowledge in Constant rounds, Proc. of 22 nd ACM Symposium on Theory of Computing, 482?493, (1990)."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"J. Cai, A. Condon, andR. Lipton:Playing Games of Incomplete Information, Proc. of 7th Symposium on Theoretical Aspects of Computer Science, 58?69, 1990.","DOI":"10.1007\/3-540-52282-4_32"},{"key":"CR8","unstructured":"L. Fortnow:Ph. D. Thesis, M.I.T.\/LCS\/TR-447"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"L. Fortnow:The Complexity of Perfect Zero-Knowledge, Proc. of 19th ACM Symposium on Theory of Computing, 204?209, 1987.","DOI":"10.1145\/28395.28418"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"U. Feige:On the Success Probability of the Two Provers in One Round Proof Systems, Proc. of Structures in Complexity Theory Conf., 1991.","DOI":"10.1109\/SCT.1991.160251"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat, andA. Shamir:Zero Knowledge Proofs of Identity, Proc of 19th ACM Symposium on Theory of Computing, 210?217, 1987.","DOI":"10.1145\/28395.28419"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"L. Fortnow, J. Rompel, andM. Sipser:On the power of Multi-Prover Interactive Protocols, Proc. of Structures in Complexity Theory Conf., 156?161, 1988.","DOI":"10.1109\/SCT.1988.5275"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"U. Feige, andA. Shamir:Witness Indistinguishable and Witness Hiding Protocols, Proc. of 22 nd ACM Symposium on Theory of Computing, 416?426, 1990.","DOI":"10.1145\/100216.100272"},{"key":"CR14","unstructured":"O. Goldreich, andA. Kahan: Private communication, 1989."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"1","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, andC. Rackoff: The Knowledge Complexity of Interactive Proof Systems,SIAM Journal of computing,1 (1989), 186?208.","journal-title":"SIAM Journal of computing"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, andA. Wigderson:Proofs that Yield Nothing But Their Validity and a Methodology of Cryptographic Protocol Design, Proc. of 27th Symposium on Foundations of Computer Science, 174?187, 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"D. Lapidot, andA. Shamir:Fully Parallelized Multi Prover Protocols for NEXP-time, Proc. of 32'nd Symposium on Foundations of Computer Science, 13?18 1991.","DOI":"10.1109\/SFCS.1991.185342"},{"key":"CR18","unstructured":"D. Peleg: Private communication, 1990."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200756.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200756\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:20:34Z","timestamp":1734956434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01200756"],"URL":"https:\/\/doi.org\/10.1007\/bf01200756","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}