Zero-Knowledge Protocols for Search Problems Ben Berger Zvika Brakerski Weizmann Institute of Science, Israel∗ Abstract

First Page		Document Content
Date: 2018-05-14 10:13:17 Complexity classes Cryptography Computational complexity theory Computing Interactive proof system Zero-knowledge proof NP IP Soundness Proof of secure erasure Certificate Zero knowledge		Zero-Knowledge Protocols for Search Problems Ben Berger Zvika Brakerski Weizmann Institute of Science, Israel∗ Abstract Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 431,28 KB Share Document on Facebook

	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - 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: 1r8mX - View Document
	An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant DocID: 1qOst - View Document
	JOURNAL OF COMPUTER AND SYSTEM SCIENCES DocID: 1qf4Y - View Document