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

Ruta Jawale
Ruta Jawale
Dakshita Khurana
Dakshita Khurana
Rachel Zhang
Rachel Zhang

IACR Cryptol. ePrint Arch, pp. 9802020.

Cited by: 1|Bibtex|Views8

Abstract:

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 ti...More

Code:

Data:

Your rating :
0

 

Tags
Comments