Practical delegation of computation using multiple servers

By Ran Canetti, Ben Riva, Guy N. Rothblum. 2011

167 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

Citations in the corpus

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, methodology): “This can be further improved by using an interactive referee delegation model [29], previously proposed for other blockchain applications [30], [31].”
Verifying computations with state (2013, background): “The client could replicate the computation (using state machine replication [23], quorums [51], or outsourcing to two clouds [5, 22]), but this technique works only if replica faults are uncorrelated.”
Arbitrum: Scalable, private smart contracts (2018, background): “Refereed-delegation (RDoC) is a two-server protocol for the problem of delegating computation [10, 11].”
A scalable verification solution for blockchains (2019, methodology): “putations by creating a binary search to pinpoint the erroneous (or not erroneous) step in a computation. The idea for the following veriﬁcation game is essentially due to Canetti, Riva, and Rothblum [39, 40] and was later independently discovered by the authors of this paper [46, 58]. Canetti, Riva”
Verifiable Computation with Massively Parallel Interactive Proofs (2012, background): “We believe our results demonstrate the immediate practicality of using GPUs for verifiable computation, and more generally, that protocols for verifiable computation have become sufficiently mature to deploy in real cloud computing systems.”
Efficient RAM and control flow in verifiable outsourced computation (2015, background): “Buffet allows the programmer to express programs in an expansive subset of C (disallowing only “goto” and function pointers), can handle essentially any example in the verifiable computation literature, and achieves the best performance in the area by multiple orders of magnitude.”
Practical verified computation with streaming interactive proofs (2011, methodology): “Thus, V can compute LDE a ( r ) incrementally from the raw stream by initializing LDE a ( r ) ← 0 , and processing each update ( i, δ ) via: V only needs to store LDE a ( r ) and r , which requires O (1) words of memory.”
Verifying computations without reexecuting them (2015, background): “This raises a central question, which goes beyond cloud computing: How can we ever trust results computed by a third-party, or the integrity of data stored by such a party? A common answer is to replicate computations [15, 16, 34].”
Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014, background): “(In contrast, when outsourcing P computations, there are implementations without expensive preprocessing: [34,107,108] consider low-depth circuits, and [37] consider outsourcing to multiple provers at least one of which is honest).”
New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, background): “[19] introduced the so-called refereed delegation of computation model, where the outsourcer delegates the computation to n 2 servers.”
Delegatable pseudorandom functions and applications (2013, methodology): “For instance, [2, 7] is covered by the subtrees rooted at nodes 001 and 01 (colored in grey).”