First Page | Document Content | |
---|---|---|
Date: 2010-03-21 22:20:21Cryptography Computational complexity theory Complexity classes Interactive proof system Zero-knowledge proof NP Probabilistically checkable proof IP Soundness Commitment scheme NEXPTIME P versus NP problem | The Complexity of Zero Knowledge Salil Vadhan∗ School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138Add to Reading ListSource URL: people.seas.harvard.eduDownload Document from Source WebsiteFile Size: 202,09 KBShare Document on Facebook |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rsiG - 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: 1rauh - View Document | |
A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drasticallyDocID: 1r7EK - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1qUxu - View Document |