Formally Verified Arguments of Knowledge in Lean

Bibliography

1

Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev. Whir: Reed–solomon proximity testing with super-fast verification. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 214–243. Springer, 2025.

2

Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, and Matan Shtepel. Fics and facs: Fast iopps and accumulation via code-switching. Cryptology ePrint Archive, 2025.

3

Eli Ben-Sasson, Alessandro Chiesa, and Nicholas Spooner. Interactive oracle proofs. In Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part II 14, pages 31–60. Springer, 2016.

4

Benedikt Bünz, Alessandro Chiesa, Giacomo Fenzi, and William Wang. Linear-time accumulation schemes. Cryptology ePrint Archive, 2025.

5

Benedikt Bünz, Ben Fisch, and Alan Szepieniec. Transparent snarks from dark compilers. In Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part I 39, pages 677–706. Springer, 2020.

6

Benedikt Bünz, Pratyush Mishra, Wilson Nguyen, and William Wang. Arc: Accumulation for reed–solomon codes. Cryptology ePrint Archive, 2024.

7

Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas Ward. Marlin: Preprocessing zksnarks with universal and updatable srs. In Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part I 39, pages 738–768. Springer, 2020.

8

Alessandro Chiesa and Eylon Yogev. Building Cryptographic Proofs from Hash Functions. 2024.

9

Abhiram Kothapalli and Bryan Parno. Algebraic reductions of knowledge. In Annual International Cryptology Conference, pages 669–701. Springer, 2023.

10

Srinath Setty. Spartan: Efficient and general-purpose zksnarks without trusted setup. In Annual International Cryptology Conference, pages 704–737. Springer, 2020.