Snargs for bounded depth computations from sub exponential lwe

Rachel Zhang
Rachel Zhang

IACR Cryptol. ePrint Arch, pp. 8602020.

被引用3|引用|浏览10

摘要

We construct a succinct non-interactive publicly-verifiable delegation scheme for any log-space uniform circuit under the sub-exponential LWE assumption, a standard assumption that is believed to be postquantum secure. For a circuit of size S and depth D, the prover runs in time poly (S), and the verifier runs in time (D+ n)· So (1), wher...更多

代码

数据

您的评分 :
0

 

标签
评论