Paper 2023/1282
Proof-Carrying Data from Multi-folding Schemes
Abstract
Proof-carrying data (PCD) is a cryptographic primitive enabling mutually distrustful parties to perform distributed computations on directed acyclic graphs with efficient and incremental verification. Key performance metrics include the prover cost at each step and the recursion overhead, which measures the additional cost beyond proving the original computation. Despite substantial advancements in constructing efficient PCD schemes, these metrics continue to be bottlenecks hindering their widespread application.
In this paper, we advance the research by constructing a new PCD scheme based on a new generalized construction of multi-folding schemes. Compared with the state-of-the-art PCD scheme by Bünz et al. (CRYPTO'21), our scheme reduces the prover cost at each step from
Note: add implementation
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- proof-carrying datarecursive proof compositionfolding schemes
- Contact author(s)
-
zbzhou @ buaa edu cn
zongyangzhang @ buaa edu cn
zknevermore @ gmail com
dongjin @ baec org cn - History
- 2024-07-11: revised
- 2023-08-25: received
- See all versions
- Short URL
- https://ia.cr/2023/1282
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2023/1282, author = {Zibo Zhou and Zongyang Zhang and Zhiyu Zhang and Jin Dong}, title = {Proof-Carrying Data from Multi-folding Schemes}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1282}, year = {2023}, url = {https://eprint.iacr.org/2023/1282} }