ZKBoo: Faster Zero-Knowledge for Boolean Circuits Irene Giacomelli Jesper Madsen Claudio Orlandi

First Page		Document Content
Date: 2016-08-12 13:45:25 Cryptography Computational complexity theory Randomized algorithms Zero-knowledge proof IP Proof of knowledge Non-interactive zero-knowledge proof Secure multi-party computation Soundness Commitment scheme Probabilistically checkable proof NP		ZKBoo: Faster Zero-Knowledge for Boolean Circuits Irene Giacomelli Jesper Madsen Claudio Orlandi Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 488,45 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