Back to Results
First PageMeta Content
Cryptography / Computational complexity theory / Complexity classes / Randomized algorithms / Zero-knowledge proof / Analysis of algorithms / NP / Commitment scheme / Probabilistically checkable proof / IP / Logarithm / XTR


Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting†∗ Jonathan Bootle1 , Andrea Cerulli1 , Pyrros Chaidos1∗∗ , Jens Groth1 , and Christophe Petit2 1
Add to Reading List

Document Date: 2016-03-08 12:29:47


Open Document

File Size: 580,31 KB

Share Result on Facebook
UPDATE