A logic of interactive proofs

09/02/2021
by   David Lehnherr, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2019

Working with first-order proofs and provers

Verifying software correctness has always been an important and complica...
research
08/13/2021

Time Transitive Functions for Zero Knowledge Proofs

Verifiable delay functions have found a lot of applications in blockchai...
research
05/17/2019

Isabelle technology for the Archive of Formal Proofs

This is an overview of the Isabelle technology behind the Archive of For...
research
05/17/2019

Isabelle technology for the Archive of Formal Proofs with application to MMT

This is an overview of the Isabelle technology behind the Archive of For...
research
09/13/2018

Towards Coinductive Theory Exploration in Horn Clause Logic: Position Paper

Coinduction occurs in two guises in Horn clause logic: in proofs of self...
research
06/07/2013

Accomplishable Tasks in Knowledge Representation

Knowledge Representation (KR) is traditionally based on the logic of fac...
research
08/09/2019

Trade-offs in Distributed Interactive Proofs

The study of interactive proofs in the context of distributed network co...

Please sign up or login with your details

Forgot password? Click here to reset