Scalable Zero Knowledge via Cycles of Elliptic Curves
Algorithmica, Volume 79, Issue 4, 2017, Pages 1102-1160.
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
PPT (Upload PPT)