First Page | Document Content | |
---|---|---|
Date: 2017-10-26 08:54:48Randomized algorithms Probabilistically checkable proof Mathematics IP Cryptography Creativity NP Soundness Proof of secure erasure Cryptographic protocol Interactive proof system | COSC 544 Probabilistic Proof SystemsLinear PCPs and Succinct Arguments Lecturer: Justin ThalerAdd to Reading ListSource URL: people.cs.georgetown.eduDownload Document from Source WebsiteFile Size: 103,34 KBShare Document on Facebook |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rgbF - View Document | |
Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1r8mX - View Document | |
An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grantDocID: 1qOst - View Document | |
JOURNAL OF COMPUTER AND SYSTEM SCIENCESDocID: 1qf4Y - View Document |