A note on efficient zero-knowledge (extended Joe NEC

First Page		Document Content
Date: 2013-10-07 12:12:36 Cryptography Computational complexity theory Complexity classes Quantum complexity theory IP NP Randomized algorithms NEXPTIME Commitment scheme Soundness XTR PP		A note on efficient zero-knowledge (extended Joe NEC Add to Reading List Source URL: people.csail.mit.edu Download Document from Source Website File Size: 915,73 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