Zero-knowledge protocols for search problems

DOI10.1007/978-3-319-98113-0_16MaRDI QIDQ1796798zbMATH OpenOpenAlexFDO

Authors Ben Berger, Zvika Brakerski

Publication date 17 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-98113-0_16

zbMATH Keywords

search problemszero-knowledge proofsinteractive proofs

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Brief announcement: Zero-knowledge protocols for search problems
• Information Security and Cryptology
• Definitions and properties of zero-knowledge proof systems
• On zero-knowledge proofs (extended abstract)
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Cited in

(3)

• Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
• Brief announcement: Zero-knowledge protocols for search problems
• Zero-knowledge elementary databases with more expressive queries

This page was built for publication: Zero-knowledge protocols for search problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1796798)