Fast verification of any remote procedure call: Short witness-indistinguishable one-round proofs for NP

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

Volumn 1853, Issue , 2000, Pages 463-474

  Aiello, William ^a   Bhatt, Sandeep ^b   Ostrovsky, Rafail ^c   Raj Rajagopalan, S ^c  

^a AT AND T LABS RESEARCH   (United States)

^b AKAMAI TECHNOLOGIES   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHECK-IN; COMPUTATIONAL ASSUMPTIONS; INTERACTIVE PROOFS; POLY-LOGARITHMIC COMMUNICATION; REMOTE PROCEDURE CALL;

AUTOMATA THEORY;

EID: 84974573487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_39     Document Type: Conference Paper

References (25)

1. A. Ambainis. Upper bound on the communication complexity of private information retrieval. In Proc. Of 24th ICALP, 1997.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.
3. L. Babai, L. Fortnow, L. Levin and M. Szegedy Checking computations in polylogarithmic time. In Proc. Of the 23rd Annual ACM Symposium on the Theory of Computing, pp. 21-31, 1991.
4. I. Biehl and B. Meyer and S. Wetzel. Ensuring the Integrity of Agent-Based Computation by Short Proofs. Mobile Agents '98, Kurt Rothermel and Fritz Hohl, editors, Lecture Notes in Computer Science, Vol. 1477, 1998, Springer-Verlag, pp. 183-194.
5. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. Of 36th FOCS, pages 41-50, 1995. Journal version to appear in JACM.
6. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Advances in Cryptology: Proceedings of EUROCRYPT99, 1999.
7. C. Dwork and M. Naor Zaps and Apps talk given at DIMACS Workshop on Cryptography and Intractability March 20 - 22, 2000 DIMACS Center, Rutgers University, Piscataway, NJ.
8. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Universal service-providers for database private information retrieval. In Proc. Of the 17th Annu. ACM Symp. on Principles of Distributed Computing, pages 91-100, 1998.
9. G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000, 2000.
10. U. Feige and J. Kilian, Two Prover Protocols: low error at affordable rates. In Proc of Annual ACM Symposium on the Theory of Computing, 1994 pp. 172-183.
11. U. Feige and A. Shamir, Witness Indistinguishable and Witness Hiding Protocols. In Proc. Of Annual ACM Symposium on the Theory of Computing 1990, pages 416-426.
12. F. Ergün, S Kumar, and R. Rubinfeld. Fast pcps for approximations. FOCS 1999.
13. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin Protecting data privacy in private information retrieval schemes. In Proc. Of the 30th Annual ACM Symposium on the Theory of Computing, pp. 151-160, 1998.
14. J. Håstad. Some optimal inapproximability results. In Proceedings of the Twenty- Ninth Annual ACM Symposium on Theory of Computing, pages 1-10, El Paso, Texas, 4-6 May 1997.
15. J. Kilian Zero-Knowledge with Logspace Verifiers. In Proceedings of the Twenty- Fourth Annual ACM Symposium on Theory of Computing, pages 25-35, El Paso, Texas, 4-6 May 1997.
16. J. Kilian Improved Efficient Arguments In Proc. Of CRYPTO Springer LNCS 963:311-324, 1995
17. J. Kilian, E. Petrank, and G. Tardos. Probabilistic Checkable Proofs with Zero Knowledge. In 29th ACM Symp. on Theory of Computation, May 1997.
18. E. Kushilevitz and R. Ostrovsky Replication is not needed: Single Database, computationally-private information retrieval. In Proc. Of Thirty-Eight Foundations of Computer Science pp. 364-373, 1997.
19. E. Kushilevitz and R. Ostrovsky. One-way Trapdoor Permutations are Sufficient for Non-Trivial Single-Database Computationally-Private Information Retrieval. In Proc. Of EUROCRYPT '00, 2000.
20. S. Micali. CS proofs (extended abstracts). In 35th Annual Symposium on Foundations of Computer Science, pages 436-453, Santa Fe, New Mexico, 20-22 1994. IEEE.
21. M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation. In Proceedings of the 31st Annual Symposium on Theory of Computing. ACM, pp. 33-43, 1999.
22. A. Polishchuk and D. Spielman Nearly-linear Size Holographic Proofs In Proceedings of the 25st Annual Symposium on Theory of Computing. ACM, pp. 194-203, 1994.
23. R. Raz A Parallel Repetition Theorem SIAM J. Computing Vol. 27, No. 3, pp. 763-803, June 1998.
24. B.S. Yee. A Sanctuary For Mobile Agents. Proceedings of the DARPA Workshop on Foundations for Secure Mobile Code. March, 1997.
25. A.C. Yao. Theory and Applications of Trapdoor Functions In 23rd Annual Symposium on Foundations of Computer Science pages 80-91, Chicago, Illinois, 3-5 November 1982. IEEE.