A logic of interactive proofs

TL;DR

This paper introduces IPJ, a probabilistic logic for reasoning about interactive proofs involving agents, and proposes a new parametrization method and a novel concept of zero-knowledge proofs.

Contribution

The paper develops a new probabilistic justification logic IPJ for interactive proofs and introduces a novel parametrization approach and zero-knowledge proof concept.

Findings

New probabilistic logic IPJ for interactive proofs

A novel parametrization method over negligible functions

Introduction of a new notion of zero-knowledge proofs

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.