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

	-Invertible Cycles for Multivariate Quadratic (MQ) Public Key Cryptography Jintai Ding1, , Christopher Wolf2 , and Bo-Yin Yang3, 1 University of Cincinnati and Technische Universität Darmstadt DocID: 1xVV9 - View Document
	Public-Key Cryptography from New Multivariate Quadratic Assumptions Yun-Ju Huang1,3 , Feng-Hao Liu2 , and Bo-Yin Yang3 1 3 DocID: 1xVNp - View Document
	ECE/CS498: Applied Cryptography Instructor: Andrew Miller, TA: Kevin Liao Lecture 2: Interactive Proofs 1 DocID: 1xVMd - View Document
	The Art of Cryptography Zero Knowledge Proofs Abhiram Kothapalli Two Balls and the Color-Blind Friend DocID: 1xVLd - View Document
	Multivariate Cryptography Louis Goubin, Versailles St-Quentin-en-Yvelines University, France, Jacques Patarin, Versailles St-Quentin-en-Yvelines University, France, and Bo-Yin Yang, Institute of Information Science, Acad DocID: 1xVDQ - View Document