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