Verifiable Delegation of Computation over Large Datasets

By Siavosh Benabbas, Rosario Gennaro, Yevgeniy Vahlis. IACR Cryptology ePrint Archive, 2011

393 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/b218c86146da7fd570863fbc35185fb334706bf3

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 Computational Theory and Mathematics

Citations in the corpus

Vector Commitments and Their Applications (2013, methodology): “Furthermore, our scheme allows for public verifiability, that was not supported by the scheme in [4].”
Verifying computations with state (2013, background): “2522733 the remote hardware and use attestation [60, 63], but what if the hardware is faulty? The client could use a tailored solution [8, 13, 18, 28, 39, 58, 70, 73, 75], but such solutions are not available for all applications.”
Practical verified computation with streaming interactive proofs (2011, neutral): “[15, 19, 51]).”
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data (2014, background): “Recently, verifiable keyword search solutions have been proposed in [30]–[32], where eac h keyword is represented as a root of some polynomial.”
Privacy and Access Control for Outsourced Personal Records (2015, background): “Other related approaches are proofsof-retrievability [59]–[62], which allow the server to prove to the client that it is actually storing all of the client’s data, verifiable databases [63], which differ from the previous ones in that the size of the database is fixed during the setup phase, and dyn”
Time-Optimal Interactive Proofs for Circuit Evaluation (2013, background): “A substantial body of work in this area has focused on the development of protocols targeted at specific problems (e.g. [2, 5, 16]).”
A Survey of Verifiable Computation (2017, background): “For instance, the schemes proposed in [4, 11, 16, 49] only support addition, exponentiation, or multiplication, so that they can achieve operation time in a microsecond level for each polynomial-level computation.”
New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, background): “Benabbas et al. [12] presented the first practical verifiable computation scheme for high degree polynomial functions based on the approach of [29] .”
Publicly verifiable delegation of large polynomials and matrix computations, with applications (2012, methodology): “Applications: As discussed in [4], polynomial computations have a large number of applications, which – using our solutions – now have publicly veriﬁable proofs: • Proof of Retrievability: The client stores a large ﬁle F with the server and later wants a short proof that the entire ﬁle can be…”
Full Accounting for Verifiable Outsourcing (2017, methodology): “In work done concurrently with and independently of Giraffe, vSQL [88] has demonstrated how to support non-deterministic ACs, by composing GKR-derived protocols with polynomial commitment schemes [24, 41, 53, 65].”
How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption (2012, methodology): “Verifiable computation schemes enable a client to outsource the computation of a functionF to an untrusted worker, and verify the correctness of the results returned by the work er [3, 9, 11, 14, 22].”