A logic of interactive proofs

DOI10.1093/LOGCOM/EXAC071MaRDI QIDQ5872872zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

epistemic logicinteractive proof systemjustification logicprobabilistic logiczero-knowledge proof

Mathematics Subject Classification ID

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

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

Cited in

(9)

• A logic of interactive proofs
• scientific article; zbMATH DE number 1629956 (Why is no real title available?)
• Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
• Interactive Coding for Interactive Proofs
• scientific article; zbMATH DE number 4072441 (Why is no real title available?)
• Interactive proofs in higher-order concurrent separation logic
• On interactive oracle proofs for Boolean R1CS statements
• Modal and justification logics for multi-agent systems (invited talk)
• Exposure and hiding: approaching the objective probability and hiding the secret in zero-knowledge proof

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)