In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
We adapt the Strand Spaces model to reason abstractly about layered security protocols, where an Application Layer protocol ed on top of a secure transport protocol. The model abst...
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...