Neo and SuperNeo: Post-quantum folding with pay-per-bit costs over small fields. Wilson Nguyen, Srinath Setty. CRYPTO 2026. ePrint 2026/242 (opens in new tab)
Vega: Low-Latency Zero-Knowledge Proofs over Existing Credentials. Darya Kaviani, Srinath Setty. IEEE S&P 2026. ePrint 2025/2094 (opens in new tab)
Nebula: Proving machine executions using folding schemes. Arasu Arun, Srinath Setty. IEEE S&P 2026, Distinguished Paper Award. ePrint 2024/1605 (opens in new tab)
Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments. Wilson Nguyen, Srinath Setty. Preprint, 2025. ePrint 2025/294 (opens in new tab)
Twist and Shout: Faster memory checking arguments via one-hot addressing and increments. Srinath Setty, Justin Thaler, Michael Zhu. Preprint, 2025. ePrint 2025/105 (opens in new tab)
MicroNova: Folding-based arguments with efficient (on-chain) verification. Jiaxing Zhao, Srinath Setty, Weidong Cui, Greg Zaverucha. IEEE S&P 2025. ePrint 2024/2099 (opens in new tab)
Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs. Sebastian Angel, Eleftherios Ioannidis, Elizabeth Margolin, Srinath Setty, Jess Woods. USENIX Security 2024. ePrint 2023/1886 (opens in new tab)
BabySpartan: Lasso-based SNARK for non-uniform computation. Srinath Setty, Justin Thaler. Preprint, 2023. ePrint 2023/1799 (opens in new tab)
Jolt: SNARKs for Virtual Machines via Lookups. Arasu Arun, Srinath Setty, Justin Thaler. EUROCRYPT 2024. ePrint 2023/1217 (opens in new tab)
Unlocking the lookup singularity with Lasso. Srinath Setty, Justin Thaler, Riad S. Wahby. EUROCRYPT 2024. ePrint 2023/1216 (opens in new tab)
CycleFold: Folding-scheme-based recursive arguments over a cycle of elliptic curves. Abhiram Kothapalli, Srinath Setty. Preprint, 2023. ePrint 2023/1192 (opens in new tab)
Revisiting the Nova Proof System on a Cycle of Curves. Wilson Nguyen, Dan Boneh, Srinath Setty. Preprint, 2023. ePrint 2023/969 (opens in new tab)
HyperNova: Recursive arguments for customizable constraint systems. Abhiram Kothapalli, Srinath Setty. CRYPTO 2024. ePrint 2023/573 (opens in new tab)
Customizable constraint systems for succinct arguments (CCS, SuperSpartan). Srinath Setty, Justin Thaler, Riad S. Wahby. Preprint, 2023. ePrint 2023/552 (opens in new tab)
SuperNova: Proving universal machine executions without universal circuits. Abhiram Kothapalli, Srinath Setty. Preprint, 2022. ePrint 2022/1758 (opens in new tab)
Transparency Dictionaries with Succinct Proofs of Correct Operation (Verdict, Phalanx). Ioanna Tzialla, Abhiram Kothapalli, Bryan Parno, Srinath Setty. NDSS 2022. ePrint 2021/1263 (opens in new tab)
Brakedown: Linear-time and field-agnostic SNARKs for R1CS. Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, Riad S. Wahby. CRYPTO 2023. ePrint 2021/1043 (opens in new tab)
Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla. CRYPTO 2022. ePrint 2021/370 (opens in new tab)
Linear-time and post-quantum zero-knowledge SNARKs for R1CS. Jonathan Lee, Srinath Setty, Justin Thaler, Riad S. Wahby. Preprint, 2021. ePrint 2021/030 (opens in new tab)
Verifiable state machines: Proofs that untrusted services operate correctly. Srinath Setty, Sebastian Angel, Jonathan Lee. ACM SIGOPS Operating Systems Review, 2020. ePrint 2020/758 (opens in new tab)
Replicated state machines without replicated execution (Piperine). Jonathan Lee, Kirill Nikitin, Srinath Setty. IEEE S&P 2020. ePrint 2020/195 (opens in new tab)
Proving the correct execution of concurrent services in zero-knowledge (Spice). Srinath Setty, Sebastian Angel, Trinabh Gupta, Jonathan Lee. OSDI 2018. ePrint 2018/907 (opens in new tab)
