A logic of interactive proofs
Logic in Computer Science
2023-09-27 v2
Abstract
We introduce the probabilistic two-agent justification logic IPJ, a logic in which we can reason about agents that perform interactive proofs. In order to study the growth rate of the probabilities in IPJ, we present a new method of parametrising IPJ over certain negligible functions. Further, our approach leads to a new notion of zero-knowledge proofs.
Keywords
Cite
@article{arxiv.2109.00775,
title = {A logic of interactive proofs},
author = {David Lehnherr and Zoran Ognjanovic and Thomas Studer},
journal= {arXiv preprint arXiv:2109.00775},
year = {2023}
}