SNARKs from LWE via Non-black-Box Reductions
Zhengzhong Jin, Mingqi Lu, Bo Peng
2026Year
Abstract
We construct the first succinct non-interactive arguments of knowledge (SNARKs) from the polynomial-hardness of Learning with Errors (LWE) for a subclass of UP languages whose witness unambiguity has a polynomial-size Extended Frege (EF) proof. Our construction achieves the following soundness guarantee:
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.
Related papers
- Adaptively Sound Zero-Knowledge SNARKs for UPSurya Mathialagan, Spencer Peters, Vinod VaikuntanathanCRYPTO 2024 · 17 citations
- Unambiguous SNARGs for P from LWE with Applications to PPAD HardnessLiyan Chen, Cody Freitag, Zhengzhong Jin, Daniel WichsSTOC 2025 · 1 citation
- Universal SNARGs for NP from Proofs of CorrectnessZhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Surya MathialaganSTOC 2025 · 2 citations
- SNARGs under LWE via Propositional ProofsZhengzhong Jin, Yael Kalai, Alex Lombardi, Vinod VaikuntanathanSTOC 2024 · 6 citations
- SNARGs for from LWEArka Rai Choudhuri, Abhishek Jain, Zhengzhong JinFOCS 2021 · 62 citations
