Scalable Zero Knowledge Via Cycles of Elliptic Curves

Algorithmica, pp. 1102-1160, 2017.

Cited by: 0|Bibtex|Views14|DOI:https://doi.org/10.1007/S00453-016-0221-0
Other Links: academic.microsoft.com

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, succinctness, requiring the proof to be very short and easy to verify. Such proof systems are known as z...More

Code:

Data:

Your rating :
0

 

Tags
Comments