Главная
Study mode:
on
1
Intro
2
Recursive composition of SNARKS
3
Foundations of recursion
4
Post-Quantum Recursion Theorem
5
Recursion in practice
6
Preprocessing implies efficient recursion
7
Evaluation of Fractal (as a standalone SNARK)
8
Post-Quantum PCD
9
Realizing recursion for Fractal
10
Evaluation of Fractal (as a recursive SNARK)
11
Post-quantum preprocessing SNARKS
12
Holographic proofs
13
From holographic PCPs to preprocessing SNARKS
14
Efficient holography?
15
Linear-size encoding of a sparse matrix
16
Summary
Description:
Explore a groundbreaking paper on post-quantum cryptography and transparent recursive proofs presented at Eurocrypt 2020. Delve into the foundations of recursive composition of SNARKs, post-quantum recursion theorems, and holographic proofs. Learn about the Fractal system's evaluation as both a standalone and recursive SNARK, and discover the implications of preprocessing for efficient recursion. Examine the concept of post-quantum preprocessing SNARKs and their connection to holographic proofs. Investigate the potential for efficient holography and linear-size encoding of sparse matrices in this cutting-edge cryptographic research.

Fractal - Post-Quantum and Transparent Recursive Proofs from Holography

TheIACR
Add to list