Delegating computation: Interactive proofs for Muggles

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 113-122

  Goldwasser, Shafi ^a   Kalai, Yael Tauman ^b   Rothblum, Guy N ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Georgia Tech

^c MIT MEDIA LAB   (United States)

Author keywords

Delegating computation; Interactive proofs; Proof verification

Indexed keywords

ADAPTIVENESS; BOOLEAN CIRCUITS; COMMUNICATION COMPLEXITIES; COMPUTATIONAL ASSUMPTIONS; COMPUTATIONAL POWERS; DELEGATING COMPUTATION; DESIGNATED VERIFIERS; EXPRESSIVE POWERS; INTERACTIVE PROOFS; KEY MODELS; LINEAR TIMES; POLYNOMIAL TIMES; PROOF SYSTEMS; PROOF VERIFICATION; PUBLIC KEYS; RANDOM ORACLE MODELS;

LINGUISTICS; NETWORKS (CIRCUITS); POLYNOMIAL APPROXIMATION; SECURITY OF DATA;

QUERY LANGUAGES;

EID: 57049095424     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (53)

1. ET, phone SETI@home!. Seience@NASA headlines, 1999.
2. The great internet mersenne prime search, project webpage. http://www.mersenne.org/, 2007.
3. SETI@home project website. http://setiathome.berkeley.edu/, 2007.
4. M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Annals of Mathematics, 160(2):781-793, 2004.
5. D. P. Anderson. Public computing: Reconnecting people to science. In Conference on Shared Knowledge and the Web, 2003.
6. D. P. Anderson. BOINC: A system for public-resource computing and storage. In GRID, pages 4-10, 2004.
7. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In FOCS, pages 14-23, 1992.
8. S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
9. L. Babai. Trading group theory for randomness. In STOC, pages 421-429, 1985.
10. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In STOC, pages 21-31, 1991.
11. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. In FOCS, pages 16-25, 1990.
12. B. Barak and O. Goldreich. Universal arguments and their applications. In CCC, pages 194-203, 2002.
13. R. Beigel, M. Bellare, J. Feigenbaum, and S. Goldwasser. Languages that are easier than their proofs. In FOCS, pages 19-28, 1991.
14. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Håstad, J. Kilian, S. Micali, and P. Rogaway. Everything provable is provable in zero-knowledge. In CRYPTO, pages 37-56, 1988.
15. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In STOC, pages 113-131, 1988.
16. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. P. Vadhan. Robust peps of proximity, shorter peps and applications to coding. In STOC, pages 1-10, 2004.
17. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. P. Vadhan. Short peps verifiable in polylogarithmic time. In CCC, pages 120-134, 2005.
18. M. Blum. How to prove a theorem so no-one else can claim it. In Proceedings of the International Congress of Mathematicians, pages 1444-1451, 1987.
19. M. Blum and S. Kannan. Designing programs that check their work. Journal of the ACM, 42(1):269-291, 1995.
20. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT, pages 402-414, 1999.
21. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. Journal of the ACM, 51(4):557-594, 2004.
22. A. Condon. Space-bounded probabilistic game automata. Journal of the ACM, 38(2):472-494, 1991.
23. A. Condon and R. E. Ladner. Probabilistic game automata. Journal of Computer and System Sciences, 36(3):452-489, 1988.
24. A. Condon and R. J. Lipton. On the complexity of space bounded interactive proofs (extended abstract). In FOCS, pages 462-467, 1989. [
25. I. Dinur. The pep theorem by gap amplification. Journal of the ACM, 54(3):12, 2007.
26. C. Dwork, M. Naor, O. Reingold, and L. J. Stockmeyer. Magic functions. Journal of the ACM, 50(6):852-921, 2003.
27. C. Dwork and L. J. Stockmeyer. Finite state verifiers i: The power of interaction. Journal of the ACM, 39(4):800-828, 1992.
28. C. Dwork and L. J. Stockmeyer. Finite state verifiers ii: Zero knowledge. Journal of the ACM, 39(4):829-858, 1992.
29. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the A CM, 43(2):268-292, 1996.
30. U. Feige and J. Kilian. Making games short (extended abstract). In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 506-516, 1997.
31. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, pages 186-194, 1986.
32. L. Fortnow. Complexity-theoretic aspects of interactive proof systems. PhD thesis. Technical Report MIT/LCS/TR-447, Massachusetts Institute of Technology, 1989.
33. L. Fortnow and C. Lund. Interactive proof systems and alternating time-space complexity. Theoretical Computer Science, 113(l):55-73, 1993.
34. 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(l):691-729, 1991.
35. S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, and G. N. Rothblum. Verifying and decoding in constant depth. In STOC, pages 440-449, 2007.
36. S. Goldwasser and Y. T. Kalai. On the (in)security of the fiat-shamir paradigm. In FOCS, pages 102-, 2003.
37. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SI AM Journal on Computing, 18(l):186-208, 1989.
38. J.Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4): 1364-1396, 1999.
39. Y.Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Zero-knowledge from secure multiparty computation. In STOC, pages 21-30, 2007.
40. Y.Ishai and A. Paskin. Evaluating branching programs on encrypted data. In TCC, pages 575-594, 2007.
41. Y.T. Kalai and R,. Raz. Interactive pep. Technical Report TR07-031, ECCC, 2007.
42. Y.T. Kalai and R. Raz. Probabilistically checkable arguments. Manuscript, 2007.
43. J.Kilian. Zero-knowledge with log-space verifiers. In FOCS, pages 25-35, 1988.
44. J.Kilian. A note on efficient zero-knowledge proofs and arguments (extended abstract). In STOC, pages 723-732, 1992.
45. J. Kilian. Improved efficient arguments (preliminary version). In CRYPTO, pages 311-324, 1995.
46. E. Kushilevitz and R,. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS, pages 364-373, 1997.
47. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, fourier transform, and learnability. Journal of the ACM, 40(3):607-620, 1993.
48. H. Lipmaa. An oblivious transfer protocol with log-squared communication. In ISC, pages 314-328, 2005.
49. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, 1992.
50. S. Micali. Cs proofs (extended abstract). In FOCS, pages 436-453, 1994.
51. M. Naor. Bit commitment using pseudo randomness. In CRYPTO, pages 128-136, 1989.
52. A. Polishchuk and D. A. Spielman. Nearly-linear size holographic proofs. In STOC, pages 194-203, 1994.
53. 53.A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869-877, 1992.