Round-Optimal Zero-Knowledge Proofs of Knowledge for NP Li HongDa†1 , Feng DengGuo2 , Li Bao1 , Xu HaiXia1 1 State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, C

First Page		Document Content
Date: 2008-12-15 09:42:20 Cryptographic protocols Probabilistic complexity theory Complexity classes Interactive proof system Proof of knowledge Zero-knowledge proof IP Soundness Commitment scheme Theoretical computer science Applied mathematics Computational complexity theory		Round-Optimal Zero-Knowledge Proofs of Knowledge for NP Li HongDa†1 , Feng DengGuo2 , Li Bao1 , Xu HaiXia1 1 State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, C Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 222,99 KB Share Document on Facebook

	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rsiG - View Document
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rauh - View Document
	A Commitment-Consistent Proof of a Shuﬄe Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically DocID: 1r7EK - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1qUxu - View Document