Proof-Carrying Data from Multi-folding Schemes

ePrint Report: Proof-Carrying Data from Multi-folding Schemes

Zibo Zhou, Zongyang Zhang, Jin Dong

Proof-carrying data (PCD) is a powerful cryptographic primitive that allows mutually distrustful parties to perform distributed computation defined on directed acyclic graphs in an efficiently verifiable manner. Important efficiency parameters include prover's cost at each step and the recursion overhead that measures the additional cost apart from proving the computation.


In this paper, we construct a PCD scheme having the smallest prover's cost and recursion overhead in …

computation cost cryptographic data defined distributed efficiency eprint report graphs important proof recursion report