Thursday, May 27, 2021 - 4:30pm to 5:30pm
Location:Virtual Presentation - ET Remote Access - Zoom
Speaker:BENEDIKT BÜNZ, Ph.D. Student https://crypto.stanford.edu/~buenz/
Proof-Carrying Data without Succinct Arguments
Proof-carrying data (PCD) is a powerful cryptographic primitive that enables mutually distrustful parties to perform distributed computations that run indefinitely. Prior approaches to construct PCD are based on recursive applications of succinct non-interactive arguments of knowledge (SNARKs) that have a succinct verifier or a succinct accumulation scheme. In this talk I will describe how to obtain PCD without relying on SNARKs. In particular, we construct a PCD scheme given any non-interactive argument of knowledge (e.g., with linear-size proofs) that has a split accumulation scheme, which is a weak form of accumulation that we introduce. We then exploit this new framework to achieve a more efficient PCD construction, by giving an accumulation scheme for a non-interactive argument of knowledge for R1CS with constant verification time. Concretely the recursive circuit can be as small as 3 exponentiations in a group with hard discrete logarithm. We also avoid the use of FFTs and other structures in the cryptographic group.
Our results are supported by a modular and efficient implementation.
Zoom Participation. See announcement.