Verifying and decoding in constant depth

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 440-449

  Goldwasser, Shafi ^a   Gutfreund, Dan ^b   Healy, Alexander ^b   Kaufman, Tali ^a   Rothblum, Guy N ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Constant depth circuits; Error correcting codes; Interactive proofs

Indexed keywords

CONSTANT-DEPTH CIRCUITS; ERROR-CORRECTING CODES; INTERACTIVE PROOFS; PROGRAM CHECKING;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; DECODING; ERROR CORRECTION; VERIFICATION;

SIGNAL RECEIVERS;

EID: 35448999667     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250855     Document Type: Conference Paper

References (26)

1. M. Ajtai. Approximate counting with uniform constant-depth circuits. In Advances in computational complexity theory, pages 1-20. Amererican Mathematical Society, 1993.
2. M. Ajtai and M. Ben-Or. A theorem on probabilistic constant depth computation. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pages 471-474, 1984.
3. 0. SIAM Journal on Computing, 2004. To appear. Preliminary version in FOCS 2004.
4. L. Babai. Trading group theory for randomness. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 421-429, 1985.
5. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 16-25, 1990.
6. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP ha,s subexponential simulation unless Exptime has publishable proofs. Computational Complexity, 3:307-318, 1993.
7. L. Babai and S. Moran. Arthur-merlin games: A randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36:254-276, 1988.
8. 1. Journal of Computer and System Sciences, 38, 1989.
9. M. Blum and S. Kannan. Designing programs that check their work. Journal of the ACM, 42(1):269-291, 1995.
10. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993.
11. U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proceedings of the 26th Annual A CM Symposium on Theory of Computing, pages 554-563, 1994.
12. U. Feige and L. Lovasz. Two-prover one-round proof systems, their power and their problems. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 733-744, 1992.
13. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity, or all languages in np have zero-knowledge proof systems. Journal of the ACM, 38(1):691-729, 1991.
14. S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, and G. Rothblum. Designing efficient program checkers by delegating their work. Manuscript, 2006.
15. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM Journal on Computing, 18(1):186-208, 1989.
16. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems, volume 5 of Advances in Computing Research, pages 73-90, 1989.
17. R. Impagliazzo, R. Jaiswal, and V. Kabanets. Approximately list-decoding direct product codes and uniform hardness amplification. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006.
18. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
19. Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In In proceedins of 29th ICALP, pages 244-256, 2002.
20. J. Kilian. Founding cryptography on oblivious transfer. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 20-31, 1988.
21. R. Lipton. New directions in testing. Proceedings of DIMACS workshop on distributed computing and cryptography, 2:191-202, 1991.
22. A. Shamir. IP = PSPACE. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 11-15, 1990.
23. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR Lemma. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 537-546, 1999.
24. L. Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347-424, 2004.
25. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, pages 129-138, 2002.
26. S. Vadhan. Personal communication, 2006.