Paper 2019/1021 Original: eprint.iacr.org/2019/1021 ↗
Recursive Proof Composition without a Trusted Setup
Abstract
Non-interactive arguments of knowledge are powerful cryptographic tools that can be used to demonstrate the faithful execution of arbitrary computations with publicly verifiable proofs. Increasingly efficient protocols have been described in recent years, with verification time and/or communication complexity that is sublinear in the size of the computation being described. These efficiencies can be exploited to realize recursive proof composition: the concept of proofs that attest to the correctness of other instances of themselves, thereby allowing large computational effort to be incrementally verified. All previously known realizations of recursive proof composition have required a trusted setup and cycles of expensive pairing-friendly elliptic curves. We obtain and implement Halo, the first practical example of recursive proof composition without a trusted setup, using the discrete log assumption over normal cycles of elliptic curves. In the process we develop several novel techniques that may be of independent interest.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2020-02-18: last updated
- 2019-09-11: published
- Short URL
- https://ia.cr/2019/1021
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/1021,
author = {Sean Bowe and Jack Grigg and Daira Hopwood},
title = {Recursive Proof Composition without a Trusted Setup},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/1021},
year = {2019},
url = {https://eprint.iacr.org/2019/1021}
}