COM S 6810 Theory of Computing March 24, 2009

First Page		Document Content
Date: 2009-03-26 12:29:21 Applied mathematics Complexity classes Arthur–Merlin protocol Probabilistic complexity theory Zero-knowledge proof IP NP Proof of knowledge Interactive proof system Theoretical computer science Cryptography Cryptographic protocols		COM S 6810 Theory of Computing March 24, 2009 Add to Reading List Source URL: www.cs.cornell.edu Download Document from Source Website File Size: 76,06 KB Share Document on Facebook

	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - View Document
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1r8mX - View Document
	An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant DocID: 1qOst - View Document
	JOURNAL OF COMPUTER AND SYSTEM SCIENCES DocID: 1qf4Y - View Document