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

	ZKProof Charter Boston, May 10th and 11th 2018 The goal of the ZKProof Standardardization effort is to advance the use of Zero Knowledge Proof technology by bringing together experts from industry and academia. To furthe DocID: 1xVl8 - View Document
	RFCSchnorr Non-interactive Zero-Knowledge Proof DocID: 1uoRK - View Document
	Computational Soundness of (Interactive) Zero-Knowledge Proof Systems in the Presence of Active Adversaries Yusuke Kawamoto1 (Jointly with Gergei Bana2 and Hideki Sakurada3) 1 DocID: 1sZcs - View Document
	Extending Web Applications with a Lightweight Zero Knowledge Proof Authentication Sławomir Grzonkowski Wojciech Zaremba DocID: 1rAaZ - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - View Document