scientific article; zbMATH DE number 7376032

DOI10.4230/LIPIcs.ICALP.2018.105zbMath1499.68115MaRDI QIDQ5002789

Zvika Brakerski, Ben Berger

Publication date: 28 July 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

interactive proofszero-knowledge proofssearch problems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Private approximation of search problems
• On the possibilities and limitations of pseudodeterministic algorithms
• A complete problem for statistical zero knowledge
• The Knowledge Complexity of Interactive Proof Systems
• Pseudo-deterministic Proofs
• Bipartite Perfect Matching in Pseudo-Deterministic NC
• Private approximation of NP-hard functions

This page was built for publication: