First Page | Document Content | |
---|---|---|
![]() Date: 2008-02-01 05:01:22Cryptographic protocols Zero-knowledge proof IP NP Commitment scheme Randomized algorithm Alice and Bob Interactive proof system Proof of knowledge Theoretical computer science Computational complexity theory Cryptography | Add to Reading List |
![]() | 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 |