First Page | Document Content | |
---|---|---|
Date: 2018-10-12 13:22:58Cryptography Proof theory Computational complexity theory Zero-knowledge proof Complexity classes Soundness IP Zero knowledge Interactive proof system PSPACE Mathematical proof Proof of knowledge | The Art of Cryptography Zero Knowledge Proofs Abhiram Kothapalli Two Balls and the Color-Blind FriendAdd to Reading ListSource URL: abhiram.meDownload Document from Source WebsiteFile Size: 4,26 MBShare 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 |