[PDF] Top 20 Efficient Non-Interactive Verifiable Outsourced Computation for Arbitrary Functions

... a verifiable outsourced computation, which enables a computationally weak client to outsource the computation of a function f on input x to a more powerful but untrusted server, who returns ... See full document

... of non-interactive MPC where there are n clients, each holding a single input bit, who send messages to a central server that computes the ...small functions requires each client to send roughly 6MB ... See full document

... general functions under the same corruption (server-sender corruptions) ...a non-private MVC protocol against arbitrary corruption only based on standard ... See full document

... Related work. VRFs have been constructed in bilinear groups by Lysyanskaya [Lys02] and Dodis [Dod03]. Based on Boneh-Boyen signatures [BB04b], Dodis and Yampolskiy [DY05] gave the first efficient scheme that is ... See full document

... of verifiable computation, showing that for any function for which an efficient ABE exists, we can construct an efficient publicly verifiable computation ...of functions ... See full document

... (publicly verifiable) non-interactive argument (for delegating ...term non-interactive argument as ...as non-interactive ...all non-interactive arguments in ... See full document

... in non-interactive and succint arguments [17, 21, 22, 24, 32, 33, 37, 41, 43, 53, 58, 61], especially SNARKs (succinct non-interactive arguments of knowledge) without ...but ... See full document

... of non-interactive verifiable computation in which there is only one round of interaction between the client and the server each time a computation is performed and introduced a ... See full document

... Another apparent distinction between the systems concerns programmability. BCTV elegantly supports not only all of C (as noted throughout) but also in principle any high-level programming language. Indeed, this ... See full document

... of non-interactive verifiable computation for general functions and gave a construction achieving this no- ...for non-interactive verifiable computation of ... See full document

... Verifiable computation [17, 13, 27, 16, 12, 10, 23] may be seen as a protocol between a (weak) client C and a server S, resulting in the provably correct computation of F (x) by the server for the ... See full document

... is made dependent not on the input and output, but on another state that occurred just a little earlier within the computation. When the Verifier recursively validates these intermediate results, reaching the very ... See full document

... of computation carried out by programs computing geometric problems [103] and various graph problems (see ...the computation for guaranteeing the correctness of an output result instead of recomputing the ... See full document

... We consider circuit-based cloud-oriented cryptographic proto- cols for secure and verifiable computation over encrypted data. Our examples share as central component Yao’s celebrated transforma- tion of a ... See full document

... cryptographic functions. Moderately hard functions are those whose difficulty to compute is somewhere in between ‘easy’ (designed to be as efficient as possible) and ‘hard’ (designed to be so difficult as to be ... See full document

... well as other languages that admit dynamic programming solutions such as the knapsack problem and the partition problem. Another natural NP relation in this class is verifying tree-based com- putations, such as checking ... See full document

... of verifiable computing could become trivial if there is no bound on the fine that can be practically levied on a wrongdoer: as long as there is even a tiniest probability of detection, then the principal can make ... See full document

... stored at a, not necessarily trusted, server. Imagine also that some other user, Bob, is allowed to query the database to perform some basic computation (such as the mean or other statistics) over Alice’s data ... See full document

... secure computation that implements the algorithm and is run between any pair of people who suspect that they might be ...secure computation requires the participants to coordinate a time where they can both ... See full document

... the A 2 adversary must use almost the same sequential time T as required by an honest execution of VDF.Sol(pp, (π, T )), and this even holds if A is allowed massive parallel computation (say we just bound the ... See full document