Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract)
Valerio Cini, Russell W. F. Lai, Giulio Malavolta
2023Year
38Citations
3Top-tier citations
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get d218fce6-2fde-4fe0-8731-62deff3b8309Cited by top-tier papers3
- Adaptively-Sound Succinct Arguments for NP from Indistinguishability ObfuscationBrent Waters, David J. WuSTOC 2024 · 18 citations
- New Techniques for Preimage Sampling: Improved NIZKs and More from LWEBrent Waters, Hoeteck Wee, David J. WuEUROCRYPT 2025 · 6 citations
- Papercraft: Lattice-Based Verifiable Delay Function ImplementedMichal Osadnik, Darya Kaviani, Valerio Cini, Russell W. F. Lai et al.S&P 2025
Related papers
- sfZinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the IntegersAlbert Garreta, Hendrik Waldner, Ilia Vlasov, Katerina Hristova et al.CRYPTO 2025 · 3 citations
- Succinct Non-interactive Arguments for DistributionsZhengzhong Jin, Mingqi Lu, Bo Peng, Yue YuCRYPTO 2026
- Faster Sounder Succinct Arguments and sfIOPsJustin Holmgren, Ron D. RothblumCRYPTO 2022 · 6 citations
- SNARGs for from LWEArka Rai Choudhuri, Abhishek Jain, Zhengzhong JinFOCS 2021 · 62 citations
- SNARKs from LWE via Non-black-Box ReductionsZhengzhong Jin, Mingqi Lu, Bo PengSTOC 2026
