Scalable Zero Knowledge via Cycles of Elliptic Curves

Algorithmica, Volume 79, Issue 4, 2017, Pages 1102-1160.

Cited by: 151|Bibtex|Views107|DOI:https://doi.org/10.1007/s00453-016-0221-0
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|link.springer.com|dl.acm.org

Abstract:

Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptographic primitive, both in theory and in practical applications. Recently, much research has focused on achieving an additional property, , requiring the proof to be very short and easy to verify. Such proof systems are known as (zk-SNARKs),...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments