Brief announcement: Zero-knowledge protocols for search problems

DOI10.4230/LIPICS.ICALP.2018.105MaRDI QIDQ5002789zbMATH OpenFDO

Authors Ben Berger, Zvika Brakerski

Publication date 28 July 2021

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2018.105

zbMATH Keywords

interactive proofssearch problemszero-knowledge proofs

Mathematics Subject Classification ID

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

Recommendations

• Zero-knowledge protocols for search problems
• Information Security and Cryptology
• On zero-knowledge proofs (extended abstract)
• An Unconditional Study of Computational Zero Knowledge
• Definitions and properties of zero-knowledge proof systems

Cites work

• A complete problem for statistical zero knowledge
• Bipartite perfect matching in pseudo-deterministic NC
• scientific article; zbMATH DE number 1256785 (Why is no real title available?)
• scientific article; zbMATH DE number 1031002 (Why is no real title available?)
• scientific article; zbMATH DE number 1754645 (Why is no real title available?)
• scientific article; zbMATH DE number 1775425 (Why is no real title available?)
• scientific article; zbMATH DE number 1418312 (Why is no real title available?)
• On the possibilities and limitations of pseudodeterministic algorithms
• Private approximation of NP-hard functions
• Private approximation of search problems
• Pseudo-deterministic proofs
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(1)

• Zero-knowledge protocols for search problems

This page was built for publication: Brief announcement: 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 Q5002789)