The Complexity of Zero Knowledge Salil Vadhan∗ School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138

First Page		Document Content
Date: 2010-03-21 22:20:21 Cryptography 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 02138 Add to Reading List Source URL: people.seas.harvard.edu Download Document from Source Website File Size: 202,09 KB Share Document on Facebook

	Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai† DocID: 1xUdf - View Document
	Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co DocID: 1xTKi - View Document
	PDF Document DocID: 1xSVG - View Document
	PDF Document DocID: 1xSM6 - View Document
	PDF Document DocID: 1xSJs - View Document