Proof-Carrying Data From Arithmetized Random Oracles

ePrint Report: Proof-Carrying Data From Arithmetized Random Oracles

Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner

Proof-carrying data (PCD) is a powerful cryptographic primitive that allows mutually distrustful parties to perform distributed computation in an efficiently verifiable manner. Known constructions of PCD are obtained by recursively-composing SNARKs or related primitives. SNARKs with desirable properties such as transparent setup are constructed in the random oracle model. However, using such SNARKs to construct PCD requires heuristically instantiating the oracle and …

box chen computation data distributed eprint report jack megan non oracle random report