Interactive PCP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 536-547

  Kalai, Yael Tauman ^a   Raz, Ran ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FORMULAS; COMMUNICATION COMPLEXITIES; NEW MODEL; NON-INTERACTIVE;

BOOLEAN FUNCTIONS; CHLORINE COMPOUNDS; NUCLEAR PROPULSION; OIL WELL PUMPS; TRANSLATION (LANGUAGES);

LINGUISTICS;

EID: 49049120522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_44     Document Type: Conference Paper

References (27)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof Verification and Hardness of Approximation Problems. J. ACM 45(3), 501-555 (1998)
2. Arora, S., Safra, S.: Probabilistic Checking of Proofs: A New Characterization of NP. J. ACM 45(1), 70-122 (1998)
3. Arora, S., Sudan, M.: Improved Low-Degree Testing and its Applications. Combinatorica 23(3), 365-426 (2003)
4. Babai, L., Fortnow, L., Lund, C.: Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity 1, 3-40 (1991)
5. Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. In: STOC 1988, pp. 113-131 (1988)
6. Babai, L., Moran, S.: Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. J. Comput. Syst. Sci. 36(2), 254-276 (1988)
7. Beigel, R.: The Polynomial Method in Circuit Complexity. In: Structure in Complexity Theory Conference, pp. 82-95 (1993)
8. Dinur, I., Fischer, E., Kindler, G., Raz, R., Safra, S.: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. In: STOC 1999, pp. 29-40 (1999)
9. Feige, U., Goldwasser, S., Lovasz, L., Safra, S., Szegedy, M.: Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43(2), 268-292 (1996)
10. Feige, U., Lovasz, L.: Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract). In: STOC 1992, pp. 733-744 (1992)
11. Fortnow, L., Santhanam, R.: Infeasibility of Instance Compression and Succinct PCPs for NP. In: STOC 2008 (2008)
12. Goldwasser, S., Kalai, Y.T., Rothblum, G.: Delegating Computation: Interactive Proofs for Mortals. In: STOC 2008 (2008)
13. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing 18(1), 186-208 (1989)
14. Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM 38(3), 691-729 (1991)
15. Harnik, H., Naor, M.: On the Compressibility of NP instances and Cryptographic Applications. In: FOCS, pp. 719-728 (2006)
16. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-Knowledge from Secure Muliparty Computation. In: STOC 2007, pp. 21-30 (2007)
17. Kalai, Y.T., Raz, R.: Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. In: FOCS 2006, pp. 355-366 (2006)
18. Kalai, Y.T., Raz, R.: Probabilistically Checkable Arguments
19. Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: STOC 1992, pp. 723-732 (1992)
20. Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic Methods for Interactive Proof Systems. J. ACM 39(4), 859-868 (1992)
21. Moshkovitz, D., Raz, R.: Sub-Constant Error Low Degree Test of Almost Linear Size. In: STOC 2006, pp. 21-30 (2006)
22. Micali, S.: CS Proofs (Extended Abstracts). In: FOCS 1994, pp. 436-453 (1994)
23. Raz, R., Safra, S.: A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In: STOC 1997, pp. 475-484 (1997)
24. Razborov, A.: Lower Bounds for the Size of Circuits of Bounded Depth with Basis {∧, ⊕}. Math. Notes of the Academy of Science of the USSR 41(4), 333-338 (1987)
25. Raz, R.: Quantum Information and the PCP Theorem. In: FOCS 2005, pp. 459-468 (2005)
26. Shamir, A.: IP=PSPACE. J. ACM 39(4), 869-877 (1992)
27. Smolensky, R.: Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In: STOC 1987, pp. 77-82 (1987)