First Page | Document Content | |
---|---|---|
Date: 2004-12-29 06:02:29Cryptographic protocols Public-key cryptography Proof of knowledge Zero-knowledge proof Digital signature Parity of a permutation PP NP XTR Cryptography Theoretical computer science Applied mathematics | Delegateable Signature Using Witness Indistinguishable and Witness Hiding Proofs Chunming Tang1,∗ Dingyi Pei1,2 Zhuojun Liu3Add to Reading ListSource URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 146,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 |