SNARKs from LWE via Non-black-Box Reductions

Zhengzhong Jin; Mingqi Lu; Bo Peng

doi:10.1145/3798129.3800888

STOC2026顶会

SNARKs from LWE via Non-black-Box Reductions

Zhengzhong Jin, Mingqi Lu, Bo Peng

DOI 出版方

2026年份

摘要

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:

问问这篇 Paper

问问你的智能体。

Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。

核心论断
横向对比
局限

你的问题

智能体调用

Lunesearch_papers

在 Lune 里问

免费开始，无需绑卡

摘要

问问这篇 Paper

问问你的智能体。

相关 Paper