<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2005-09-09 15:31:38Computational complexity theory Theory of computation Complexity classes Randomized algorithms Models of computation IP NP ArthurMerlin protocol Interactive proof system BPP PP Zero-knowledge proof |
Add to Reading List |
The KnowledgeComplexity of Interactive Proof-Systems (ExtendedAbstract) ShafiGoldwasser SilvioMicali CharlesRackoff MIT MIT Universityof Toronto | 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 |