{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:31:55Z","timestamp":1725489115060},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551881"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_16","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"213-224","source":"Crossref","is-referenced-by-count":3,"title":["A One-Round, Two-Prover, Zero-Knowledge Protocol for NP"],"prefix":"10.1007","author":[{"given":"Dror","family":"Lapidot","sequence":"first","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","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, Proceedings of 16th ICALP (1989).","DOI":"10.1007\/BFb0035756"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali and R. Ostrovsky. Perfect Zero-Knowledge in Constant Rounds, Proceedings of the 22nd annual ACM Symposium on Theory of Computing (1990), 482\u2013493.","DOI":"10.1145\/100216.100283"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. Proceedings of the 20th annual ACM Symposium on Theory of Computing (1988), 113\u2013131.","DOI":"10.1145\/62212.62223"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"R. Boppana, J. Hastad and S. Zachos. Does CoNP Have Short Interactive Proofs?, Information Processing Letters 252 (1987), 127\u2013132.","journal-title":"Information Processing Letters"},{"key":"16_CR5","unstructured":"L. Fortnow. Complexity Theoretic Aspects of Interactive Proof Systems, Ph.D. Thesis, MIT\/LCS\/TR-447, (1989)."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"L. Fortnow. The Complexity of Perfect Zero-Knowledge, Proceedings of the 19th annual ACM Symposium on Theory of Computing (1987), 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"U. Feige. On the Success Probability of the Two Provers in One-Round Proof Systems, Proceedings of the 6th Structure in Complexity Theory Conference (1991), IEEE.","DOI":"10.1109\/SCT.1991.160251"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat and A. Shamir. Zero Knowledge Proofs of Identity, Proceedings of the 19th annual ACM Symposium on Theory of Computing (1987), 210\u2013217.","DOI":"10.1145\/28395.28419"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"L. Fortnow, J. Rompel and M. Sipser. On the Power of Multi-Prover Interactive Protocols, Proceedings of the 3rd Structure in Complexity Theory Conference (1988), 156\u2013161.","DOI":"10.1109\/SCT.1988.5275"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Protocols, Proceedings of the 22th annual ACM Symposium on Theory of Computing (1990), 416\u2013426.","DOI":"10.1145\/100216.100272"},{"key":"16_CR11","unstructured":"O. Goldreich and A. Kahan, private communication (1990)."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design, Proceedings of the 27th Symposium on Foundations of Computer Science (1986), IEEE, 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proofs, Proceedings of the 17th annual ACM Symposium on Theory of Computing (1985), 291\u2013304.","DOI":"10.1145\/22145.22178"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:24Z","timestamp":1605647604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_16","relation":{},"subject":[]}}