This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from ...