Protocol composition logic (PCL)

A Datta, A Derek, JC Mitchell, A Roy - Electronic Notes in Theoretical …, 2007 - Elsevier
Protocol Composition Logic (PCL) is a logic for proving security properties of network
protocols that use public and symmetric key cryptography. The logic is designed around a …

A modular correctness proof of IEEE 802.11 i and TLS

C He, M Sundararajan, A Datta, A Derek… - Proceedings of the 12th …, 2005 - dl.acm.org
The IEEE 802.11 i wireless networking protocol provides mutual authentication between a
network access point and user devices prior to user connectivity. The protocol consists of …

ASPIER: An automated framework for verifying security protocol implementations

S Chaki, A Datta - 2009 22nd IEEE Computer Security …, 2009 - ieeexplore.ieee.org
We present ASPIER-the first framework that combines software model checking with a
standard protocol security model to automatically analyze authentication and secrecy …

Distance bounding protocols: Authentication logic analysis and collusion attacks

C Meadows, R Poovendran, D Pavlovic… - Secure localization and …, 2007 - Springer
In this paper we consider the problem of securely measuring distance between two nodes in
a wireless sensor network. The problem of measuring distance has fundamental …

Formal analysis of Kerberos 5

F Butler, I Cervesato, AD Jaggard, A Scedrov… - Theoretical Computer …, 2006 - Elsevier
We report on the detailed verification of a substantial portion of the Kerberos 5 protocol
specification. Because it targeted a deployed protocol rather than an academic abstraction …

Compositional analysis of contract-signing protocols

M Backes, A Datta, A Derek, JC Mitchell… - Theoretical Computer …, 2006 - Elsevier
We develop a general method for proving properties of contract-signing protocols using a
specialized protocol logic. The method is applied to the Asokan–Shoup–Waidner and the …

An encapsulated authentication logic for reasoning about key distribution protocols

I Cervesato, C Meadows… - 18th IEEE Computer …, 2005 - ieeexplore.ieee.org
Authentication and secrecy properties are proved by very different methods: the former by
local reasoning, leading to matching knowledge of all principals about the order of their …

Compositional system security with interface-confined adversaries

D Garg, J Franklin, D Kaynar, A Datta - Electronic Notes in Theoretical …, 2010 - Elsevier
This paper presents a formal framework for compositional reasoning about secure systems.
A key insight is to view a trusted system in terms of the interfaces that the various …

Deriving secrecy in key establishment protocols

D Pavlovic, C Meadows - … –ESORICS 2006: 11th European Symposium on …, 2006 - Springer
Secrecy and authenticity properties of protocols are mutually dependent: every
authentication is based on some secrets, and every secret must be authenticated. This …

Actor-network procedures

D Pavlovic, C Meadows - International Conference on Distributed …, 2012 - Springer
In this paper we propose actor-networks as a formal model of computation in heterogenous
networks of computers, humans and their devices, where these new procedures run; and we …