Publicly verifiable delegation of large polynomials and matrix computations, with applications

By Dario Fiore, Rosario Gennaro. 2012

249 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

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 Information Systems

Citations in the corpus

Slalom: Fast, Verifiable and Private Execution of Neural Networks in Trusted Hardware (2018, methodology): “There are protocols with lower communication than repeatedly using Freivalds’ ((Fiore & Gennaro, 2012; Thaler, 2013; Ghodsi et al., 2017)).”
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, unknown): “[15, 19, 51]).”
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].”
Secure Outsourced Matrix Computation and Application to Neural Networks (2018, unknown): “There are general results [16, 20, 21] of verifiable secure computation outsourcing by applying a fully HE scheme with Yao’s Garbled circuit or pseudo-random functions.”
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.”
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.”
A Hybrid Architecture for Interactive Verifiable Computation (2013, background): “Some work targets particular classes of computations [18, 38], including matrix operations and polynomial evaluation; for a survey, see [45].”