2000 character limit reached
A logic of interactive proofs
Published 2 Sep 2021 in cs.LO | (2109.00775v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.