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

	1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum DocID: 1oKqW - View Document
	Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Query Answering in the Description Logic S ⋆ Meghyn Bienvenu1 , Thomas Eiter2 , Carsten Lutz1 , 2 ˇ DocID: 1kbPF - View Document
	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† DocID: 18Jpc - View Document
	Interactive proofs with competing teams of no-signaling provers DocID: 13Xht - View Document
	A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract DocID: 13PJR - View Document