Proofs that Yield All Languages Proof

First Page		Document Content
Date: 2014-03-23 11:48:58 Complexity classes Cryptographic protocols Probabilistic complexity theory Models of computation Interactive proof system Zero-knowledge proof NP IP Arthur–Merlin protocol Theoretical computer science Computational complexity theory Applied mathematics		Proofs that Yield All Languages Proof Add to Reading List Source URL: nakamotoinstitute.org Download Document from Source Website File Size: 2,90 MB 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