How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption

By Bryan Parno, Mariana Raykova, Vinod Vaikuntanathan. 2012

379 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

Pinocchio: Nearly Practical Verifiable Computation (2013, methodology): “More formally, we define public VC as follows, generalizing previous definitions [22, 29, 30].”
New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, methodology): “Based on this work, Parno et al. [43] showed a construction of a multi-function verifiable computation scheme.”
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, background): “As an example, the recent work of [2] building verifiable computation schemes from KP-ABE systems only produces meaningful results when one starts with a KPABE scheme that can be proven secure without incurring the blowup of this encoding technique.”
Attribute-based encryption for circuits (2013, background): “It has also found applications in scenarios that demand complex policies to control access to encrypted data, as well as in designing cryptographic protocols for verifiably outsourcing computations [37].”
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013, background): “[34] we get a delegatable computation scheme with where the client’s work is independent of the circuit size.”
A Survey of Verifiable Computation (2017, background): “A lot of remarkable general solutions [3 – 6, 22, 38 – 50] were also designed to offer compelling properties.”
Publicly verifiable delegation of large polynomials and matrix computations, with applications (2012, methodology): “Recently, a new ABE scheme has been presented that removes the selective security issue [15], and therefore when combined with [21] should yield a fully secure veriﬁ-able computation solution.”
Reusable garbled circuits and succinct functional encryption (2013, methodology): “By replacing the ABE scheme in the construction of [43] with our new functional encryption scheme, we add secrecy to the scheme; namely, we obtain a delegation scheme which is both publicly verifiable as in [43] (anyone can verify that a transcript is accepting using only public information) and…”
Quadratic Span Programs and Succinct NIZKs without PCPs (2013, methodology): “In the full version [22], we use our QSPbased SNARK to achieve a very efficient scheme for public verifiable computation [21, 39].”
Attribute-Based Encryption With Verifiable Outsourced Decryption (2013, background): “[23] establish an important connection between verifiable com-”
Delegatable pseudorandom functions and applications (2013, background): “, [8, 1, 31, 16, 7]) or specific crypto-related operations (e.”
ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data (2015, background): “However, alternative approaches to realizing verifiable computation have been proposed, notably based on fully homomorphic encryption [37–39] or attributebased encryption [40].”
Multi-Input Functional Encryption (2014, methodology): “We can also apply multi-input symmetric-key FE to verifiable computation, using the ideas of [29].”
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions (2018, background): “Decentralized Computation Verifiable Computation Privately Verifiable Computation [187], [189], [192], [193], Publicly Verifiable Computation [154], [190], [191], [194]”