Scalable zero knowledge via cycles of elliptic curves
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
Scalable Zero Knowledge Via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza - Algorithmica, 2017 - dl.acm.org
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
[PDF][PDF] Scalable Zero Knowledge via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza - 2014 - Citeseer
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
[PDF][PDF] Scalable Zero Knowledge via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza - 2014 - cs-people.bu.edu
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
[PDF][PDF] Scalable Zero Knowledge via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza - iacr.org
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
Scalable Zero Knowledge Via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza - 2016 - dspace.mit.edu
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
Scalable Zero Knowledge via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer… - Cryptology ePrint Archive, 2014 - eprint.iacr.org
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
Scalable Zero Knowledge via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza - Advances in Cryptology …, 2014 - Springer
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
[PDF][PDF] Scalable Zero Knowledge via Cycles of Elliptic Curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza - 2016 - eprint.iacr.org
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 …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …