theory

Papers (11)
# | Title | |
1. | Separating succinct non-interactive arguments from all falsifiable assumptions Gentry, Craig and Wichs, Daniel. 2011. | |
2. | Succinct non-interactive arguments via linear interactive proofs Bitansky, Nir and Chiesa, Alessandro and Ishai, Yuval and Paneth, Omer and Ostrovsky, Rafail. 2013. | |
3. | Recursive composition and bootstrapping for SNARKs and proof-carrying data Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran. 2013. | |
4. | Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model Sean Bowe and Ariel Gabizon and Ian Miers. 2017. | |
5. | On the (in) security of SNARKs in the presence of oracles Fiore, Dario and Nitulescu, Anca. 2016. | |
6. | Reducing Participation Costs via Incremental Verification for Ledger Systems Weikeng Chen and Alessandro Chiesa and Emma Dauterman and Nicholas P. Ward. 2020. | |
7. | Witness-Succinct Universally-Composable SNARKs Ganesh, Chaya and Kondi, Yashvanth and Orlandi, Claudio and Pancholi, Mahak and Takahashi, Akira and Tschudi, Daniel. 2022. | |
8. | Algebraic Group Model with Oblivious Sampling Helger Lipmaa and Roberto Parisella and Janno Siim. 2023. | |
9. | Barriers for Succinct Arguments in the Random Oracle Model Alessandro Chiesa and Eylon Yogev. 2020. | |
10. | Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains Scafuro, Alessandra and Siniscalchi, Luisa and Visconti, Ivan. 2020. | |
11. | On Soundness Notions for Interactive Oracle Proofs Alexander R. Block and Albert Garreta and Pratyush Ranjan Tiwari and Michał Zając. 2023. |
Videos
–
Links
–