Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT III, pp. 247-277, 2017.

Cited by: 36|Bibtex|Views23|DOI:https://doi.org/10.1007/978-3-319-56617-7_9
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

Succinct non-interactive arguments (SNARGs) enable verifying NP computations with substantially lower complexity than that required for classical NP verification. In this work, we give the first lattice-based SNARG candidate with quasi-optimal succinctness (where the argument size is quasilinear in the security parameter). Further extensi...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments