A logic of interactive proofs

DOI10.1093/LOGCOM/EXAC071OpenAlexW3198454556WikidataQ115037471 ScholiaQ115037471MaRDI QIDQ5872872FDOQ5872872

Authors: David Lehnherr, Thomas Studer, Zoran Ognjanović 

Publication date: 4 January 2023

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exac071

Recommendations

• A logic of interactive proofs
• Logic of non-monotonic interactive proofs
• Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
• Interacting explicit evidence systems
• The knowledge complexity of interactive proof-systems

zbMATH Keywords

epistemic logicjustification logicprobabilistic logiczero-knowledge proofinteractive proof system

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cited In (8)

• Modal and justification logics for multi-agent systems (invited talk)
• Interactive Coding for Interactive Proofs
• Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
• On interactive oracle proofs for Boolean R1CS statements
• Title not available (Why is that?)
• A logic of interactive proofs
• Title not available (Why is that?)
• Interactive proofs in higher-order concurrent separation logic

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

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