SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE

Ruta Jawale
Ruta Jawale
Rachel Zhang
Rachel Zhang

IACR Cryptol. ePrint Arch., pp. 9802020.

被引用0|引用|浏览3
其它链接academic.microsoft.com

摘要

We construct a succinct non-interactive publicly-verifiable delegation scheme for any logspace uniform circuit under the sub-exponential Learning With Errors (LWE) assumption. For a circuit C : {0, 1} N → {0, 1} of size S and depth D, the prover runs in time poly(S), the communication complexity is D · polylog(S), and the verifier runs in...更多

代码

数据

您的评分 :
0

 

标签
评论