
Abstract 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.
FOS: Computer and information sciences, epistemic logic, Computer Science - Logic in Computer Science, interactive proof system, Logics of knowledge and belief (including belief change), probabilistic logic, Probability and inductive logic, Logic in Computer Science (cs.LO), zero-knowledge proof, Mechanization of proofs and logical operations, justification logic
FOS: Computer and information sciences, epistemic logic, Computer Science - Logic in Computer Science, interactive proof system, Logics of knowledge and belief (including belief change), probabilistic logic, Probability and inductive logic, Logic in Computer Science (cs.LO), zero-knowledge proof, Mechanization of proofs and logical operations, justification logic
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
