Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT III, pp. 222-255, 2018.

Cited by: 18|Bibtex|Views468|DOI:https://doi.org/10.1007/978-3-319-78372-7_8
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

Succinct non-interactive arguments (SNARGs) enable verifying NP computations with significantly less complexity than that required for classical NP verification. In this work, we focus on simultaneously minimizing the proof size and the prover complexity of SNARGs. Concretely, for a security parameter A, we measure the asymptotic cost of ...More

Code:

Data:

Your rating :
0

 

Tags
Comments