Devadas et al. revisit building SNARGs for NP using non-signaling PCPs, propose a candidate scheme with security under LWE and a mathematical conjecture, circumventing the Gentry-Wichs black-box barrier. Devadas等人在论文中重新探讨了基于非信号PCP构建NP的SNARGs,提出候选方案并证明其在LWE假设和多项式理想成员证明的数学猜想下的安全性,突破了Gentry-Wichs黑盒障碍。
Notes
Exponential-length PCPs circumvent existing barriers for NP SNARGs
Propose non-adaptive SNARG candidate with security under LWE
Introduce mathematical conjecture on polynomial ideals (non-cryptographic)
Non-black-box adversary use breaks Gentry-Wichs black-box barrier
Blueprint for NP SNARGs not subject to Gentry-Wichs barrier
Re-evaluate potential of non-signaling PCPs in SNARG construction