![Cryptography / Computational complexity theory / Complexity classes / Randomized algorithms / Zero-knowledge proof / Analysis of algorithms / NP / Commitment scheme / Probabilistically checkable proof / IP / Logarithm / XTR Cryptography / Computational complexity theory / Complexity classes / Randomized algorithms / Zero-knowledge proof / Analysis of algorithms / NP / Commitment scheme / Probabilistically checkable proof / IP / Logarithm / XTR](https://www.pdfsearch.io/img/577b140b08f407a32b96f5ddbda90a7b.jpg) Date: 2016-03-08 12:29:47Cryptography 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 1Add to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 580,31 KBShare Document on Facebook
|