License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.105
URN: urn:nbn:de:0030-drops-91099
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9109/
Berger, Ben ;
Brakerski, Zvika
Brief Announcement: Zero-Knowledge Protocols for Search Problems
Abstract
We consider natural ways to extend the notion of Zero-Knowledge (ZK) Proofs beyond decision problems. Specifically, we consider search problems, and define zero-knowledge proofs in this context as interactive protocols in which the prover can establish the correctness of a solution to a given instance without the verifier learning anything beyond the intended solution, even if it deviates from the protocol.
The goal of this work is to initiate a study of Search Zero-Knowledge (search-ZK), the class of search problems for which such systems exist. This class trivially contains search problems where the validity of a solution can be efficiently verified (using a single message proof containing only the solution). A slightly less obvious, but still straightforward, way to obtain zero-knowledge proofs for search problems is to let the prover send a solution and prove in zero-knowledge that the instance-solution pair is valid. However, there may be other ways to obtain such zero-knowledge proofs, and they may be more advantageous.
In fact, we prove that there are search problems for which the aforementioned approach fails, but still search zero-knowledge protocols exist. On the other hand, we show sufficient conditions for search problems under which some form of zero-knowledge can be obtained using the straightforward way.
BibTeX - Entry
@InProceedings{berger_et_al:LIPIcs:2018:9109,
author = {Ben Berger and Zvika Brakerski},
title = {{Brief Announcement: Zero-Knowledge Protocols for Search Problems}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {105:1--105:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9109},
URN = {urn:nbn:de:0030-drops-91099},
doi = {10.4230/LIPIcs.ICALP.2018.105},
annote = {Keywords: Zero-Knowledge, Search Problems, Interactive Proofs}
}
Keywords: |
|
Zero-Knowledge, Search Problems, Interactive Proofs |
Collection: |
|
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
04.07.2018 |