Aurora: Transparent Sucinct Arguments for R1CS - Nick Spooner and Dev Ojha, UC Berkeley
Aurora: Succinct Transparent Arguments for R1CS
Aurora: Transparent Succinct Arguments for R1CS - Alessandro Chiesa
[7B] Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
s-18: Succinct Arguments
Proof-Carrying Data without Succinct Arguments
An R1CS Based Implementation of Bulletproofs - Cathie Yun, Interstellar
Keynote: Linear-Time SNARKs for R1CS and Friends - Justin Thaler (Georgetown)
SNARK Research & Pedagogy with Alessandro Chiesa
Benedikt Bünz: Proof-Carrying Data without Succinct Arguments
Security Bounds for Succinct Arguments from Hash Functions | Prof. Alessandro Chiesa
Fractal: Post-Quantum and Transparent Recursive Proofs from Holography
"On Interactive Oracle Proofs for Boolean R1CS Statements" - Emanuele Giunta
High-Speed zkSNARKs without Trusted Setup - Srinath Setty
Transparent SNARKs from DARK Compilers
CESC2017 - Alessandro Chiesa - Zerocash
Polaris zkSNARK, Guang Gong | UBRI Connect 2022
ZK-LDN 0x01: Designing efficient R1CS circuits - Daira Hopwood
Zk-SNARK - Part 1 - Problem statement to R1CS
zkStudy Club: Subquadratic SNARGs in the Random Oracle Model [Eylon Yogev, TAU/BIU]
![[7B] Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier](https://img.youtube.com/vi/61bPghBodX8/0.jpg)
![zkStudy Club: Subquadratic SNARGs in the Random Oracle Model [Eylon Yogev, TAU/BIU]](https://img.youtube.com/vi/yQAkqetx_xQ/0.jpg)