Tugkan Batu, Ronitt Rubinfeld, Patrick White  Home/Search
Context Related
| cornell.edu/Info/People/batu/pap...r.ps From: cornell.edu/Info/People/ba...batu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we consider the verification and certification of computations that are done remotely. We investigate the use of probabilistically checkable proof (PCP) systems for efficiently certifying such computations. This model can also be applied to verifying security proofs of software downloads. To make the use of PCPs more practical, a new version of Cook's Theorem is given for the RAM model: that is, we show that a correct computation of a RAM can be encoded as a satisfiable boolean... (Update)
Cited by: More
Trading Processor Cycles for Communication - Arnab Paul Rahul (2004) (Correct)
Active bibliography (related documents): More All
1.2: Fast approximate PCPs - Ergün, Kumar, Rubinfeld (1999) (Correct)
0.2: Interactive Proof Systems And Alternating Time-Space Complexity - Lance Fortnow (1991) (Correct)
0.1: Communication Complexity and Secure Function Evaluation - Naor, Nissim (2001) (Correct)
Similar documents based on text: More All
0.4: Testing Random Variables for Independence and Identity - Tugkan Batu Eldar (2001) (Correct)
0.3: Certified Computation - Arkoudas (2001) (Correct)
0.3: Small PCPs with Low Query Complexity - Harsha, Sudan (2000) (Correct)
BibTeX entry: (Update)
T. Batu, R. Rubinfeld, and P. White. Runtime verification of remotely executed code using probabilistically checkable proof systems. http://citeseer.ist.psu.edu/467129.html More
@misc{ batu-runtime,
author = "T. Batu and R. Rubinfeld and P. White",
title = "Runtime verification of remotely executed code using probabilistically
checkable proof systems",
text = "T. Batu, R. Rubinfeld, and P. White. Runtime verification of remotely executed
code using probabilistically checkable proof systems.",
url = "citeseer.ist.psu.edu/467129.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1996
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1998
242 Non-deterministic exponential time has two-prover interactiv.. - Babai, Fortnow et al. - 1991
192 Designing programs that check their work - Blum, Kannan - 1995
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
155 Checking computations in polylogarithmic time - Babai, Fortnow et al. - 1990
98 Computationally private information retrieval with polylogar.. - Cachin, Micali et al. - 1999
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1986
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
94 Self testingcorrecting with application to numerical problem - Luby, testing et al. - 1993
86 New directions in testing (context) - Lipton - 1991
83 Multi-prover interactive proofs: How to remove intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988
81 Replication is not needed: Single database (context) - Kushilevitz, Ostrovsky - 1997
73 Linear-time encodable and decodable error-correcting codes - Spielman - 1996
50 Nearly-linear Size Holographic Proofs (context) - Polishchuk, Spielman - 1994
43 Self testingcorrecting polynomial and approximate function - Lipton, Sudan et al. - 1991
39 Probabilistic checkable proofs: A new characterization of NP (context) - Arora, Safra - 1998
35 A note on efficient zero-knowledge proofs and arguments (context) - Kilian - 1992
22 Finite state verifiers I: The power of interaction (context) - Dwork, Stockmeyer - 1992
11 Advances in Cryptology -- CRYPTO (context) - Merkle, digital et al. - 1989
11 Advances in Cryptology -- CRYPTO (context) - Kilian, arguments et al. - 1995
9 Computer Science Department (context) - Necula, Lee et al. - 1996
4 Interactive proof systems with a log space verifier (context) - Fortnow, Sipser - 1988
3 th Structure in Complexity Theory (context) - Cai, Lipton et al. - 1993
3 th Foundations of Computer Science (context) - Micali, Proc - 1994
1 the use of interactive proofs for formal program verificatio.. - Feige, Nissim - 1997
1 Interactive Proof-Carrying Code (context) - Dwork, Kannan et al.
Documents on the same site (http://www.cs.cornell.edu/Info/People/batu/batu.html):
Testing That Distributions Are Close - Batu, Fortnow, al. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC