First Page | Document Content | |
---|---|---|
Date: 2018-05-14 10:13:17Complexity classes Cryptography Computational complexity theory Computing Interactive proof system Zero-knowledge proof NP IP Soundness Proof of secure erasure Certificate Zero knowledge | Zero-Knowledge Protocols for Search Problems Ben Berger Zvika Brakerski Weizmann Institute of Science, Israel∗ AbstractAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 431,28 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 |