First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 580,31 KBShare Document on Facebook |
Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†DocID: 1xUdf - View Document | |
Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-coDocID: 1xTKi - View Document | |
PDF DocumentDocID: 1xSVG - View Document | |
PDF DocumentDocID: 1xSM6 - View Document | |
PDF DocumentDocID: 1xSJs - View Document |