#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2003

2017

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Anupam Datta, Ante Derek, John C. Mitchell, Dusko Pavlovic
- Journal of Computer Security
- 2005

Many authentication and key exchange protocols are built using an accepted set of standard concepts such as Diffieâ€“Hellman key exchange, nonces to avoid replay, certificates from an acceptedâ€¦ (More)

- Anupam Datta, Ante Derek, John C. Mitchell, Arnab Roy
- Electr. Notes Theor. Comput. Sci.
- 2007

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 process calculus withâ€¦ (More)

- Anupam Datta, Ante Derek, John C. Mitchell, Dusko Pavlovic
- CSFW
- 2003

Many authentication and key exchange protocols are built using an accepted set of standard concepts such as Diffie-Hellman key exchange, nonces to avoid replay, certificates from an acceptedâ€¦ (More)

- Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell, Jean-Pierre Seifert
- ASIAN
- 2006

Extending a compositional protocol logic with an induction rule for secrecy, we prove soundness for a conventional symbolic protocol execution model, adapt and extend previous composition theorems,â€¦ (More)

- Changhua He, Mukund Sundararajan, Anupam Datta, Ante Derek, John C. Mitchell
- ACM Conference on Computer and Communicationsâ€¦
- 2005

The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of several parts,â€¦ (More)

- Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi
- 19th IEEE Computer Security Foundations Workshopâ€¦
- 2006

We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventional runs of a protocolâ€¦ (More)

We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a maliciousâ€¦ (More)

- Anupam Datta, Ante Derek, John C. Mitchell, Dusko Pavlovic
- Proceedings. 17th IEEE Computer Securityâ€¦
- 2004

Protocols may be derived from initial components by composition, refinement, and transformation. Adding function variables to a previous protocol logic, we develop an abstraction-instantiation methodâ€¦ (More)

- Michael Backes, Anupam Datta, Ante Derek, John C. Mitchell, Mathieu Turuani
- 18th IEEE Computer Security Foundations Workshopâ€¦
- 2005

We develop a general method for reasoning about contract-signing protocols using a specialized protocol logic. The method is applied to prove properties of the Asokan-Shoup-Waidner and theâ€¦ (More)