A logic of interactive proofs

DOI10.1007/978-3-030-93100-1_10OpenAlexW4205450054MaRDI QIDQ2151405

Thomas Studer, David Lehnherr, Zoran Ognjanović

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2109.00775

zbMATH Keywords

epistemic logicjustification logicprobabilistic logiczero-knowledge proofinteractive proof system

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ontology of justifications in the logical setting
• The logic of proofs, semantically
• Interacting explicit evidence systems
• Some first-order probability logics
• Justification logic with approximate conditional probabilities
• Completeness theorems for \(\sigma \)-additive probabilistic semantics
• A logic with approximate conditional probabilities that can model default reasoning
• Explicit Provability and Constructive Semantics
• Probability Logics
• Introducing Justification into Epistemic Logic
• The knowledge complexity of interactive proof-systems
• First steps towards probabilistic justification logic
• Weak arithmetical interpretations for the Logic of Proofs
• Probabilistic justification logic
• Computational Complexity
• Justification Logic

This page was built for publication: A logic of interactive proofs