logic of interactive proofs.

We introduce the probabilistic two-agent justification logic |$\textsf {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 |$\textsf {IPJ}$|⁠ , we present a new method of parametrizing |$\textsf {IPJ}$| over certain negligible functions. Further, our approach leads to a new notion of zero-knowledge proofs. [ABSTRACT FROM AUTHOR]