Design and Analysis of Security Protocols

Course description

Reference

CS 395T - Design and Analysis of Security Protocols (54302)

Fall 2004

Reference materials

Design principles for security protocols

Prudent Engineering Practice for Cryptographic Protocols by Abadi and Needham

Protocol libraries

Clark-Jacob survey: A Survey of Authentication Protocol Literature: Version 1.0
Security Protocols Open Repository at ENS-Cachan
Proposed IETF standards: Current Internet-Drafts (a few security protocols here)
Current RFCs: Official Internet Protocol Standards (a few security protocols here)

Needham-Schroeder

Using Encryption for Authentication in Large Networks of Computers by Needham and Schroeder
Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR by Lowe

Secure Sockets Layer (SSL) and Transport Layer Security (TLS)

TLS Protocol Version 1.0 specification
Analysis of the SSL 3.0 protocol by Wagner and Schneier
Finite-State Analysis of SSL 3.0 by Mitchell, Shmatikov, and Stern
Chosen Ciphertext Attacks against Protocols Based on RSA Encryption Standard PKCS #1 by Bleichenbacher

Internet Key Exchange (IKE)

IP Security protocol suite
Internet Key Exchange (IKE) specification
IKE version 2 specification
IKE/ISAKMP Considered Harmful by Simpson
Analysis of the Internet Key Exchange Protocol Using the NRL Protocol Analyzer by Meadows

Just Fast Keying (JFK)

Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols by Aiello, Bellovin, Blaze, Canetti, Ioannidis, Keromytis, and Reingold
Just Fast Keying (JFK) specification
Derivation of the JFK Protocol by Datta, Mitchell, and Pavlovic
Just Fast Keying in the Pi Calculus by Abadi, Blanchet, and Fournet
- Proofs and verification scripts for Just Fast Keying in the Pi Calculus

Anonymity

Anonymity bibliography from the Free Haven project
Deployed systems:
- TOR: Anonymizing relay network for TCP
- Onion Routing: Anonymous communication infrastructure
- Mixminion: Type III anonymous remailer
- Mixmaster: Type II anonymous remailer
Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms by Chaum
The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability by Chaum
Crowds: Anonymity for Web Transactions by Reiter and Rubin
Timing Attacks in Low-Latency Mix Systems by Levine, Reiter, Wang, and Wright
Cypherpunks

Probabilistic analysis of security protocols

An Analysis of the Degradation of Anonymous Protocols by Wright, Adler, Levine, and Shields
Probabilistic Model Checking of an Anonymity System by Shmatikov
Analysis of Probabilistic Contract Signing by Norman and Shmatikov

Protocol composition logic and the inductive method

Protocol Composition Logic and Derivation System: papers and presentations
Verifying Security Protocols Using Isabelle: papers and presentations

Symbolic constraint solving

Constraint Solving for Bounded-Process Cryptographic Protocol Analysis by Millen and Shmatikov
An Improved Constraint-Based System for the Verification of Security Protocols by Corin and Etalle

Cryptographic definitions of security

Introduction to Modern Cryptography by Bellare and Rogaway
Papers on Authentication and Key Distribution by Bellare et al.
On Formal Models for Secure Key Exchange by Shoup

Computational soundness of formal methods

Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) by Abadi and Rogaway
Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions by Micciancio and Warinschi
Soundness of Formal Encryption in the Presence of Active Adversaries by Micciancio and Warinschi

Universal composability

Universally Composable Security: A New Paradigm for Cryptographic Protocols by Canetti
Universal Composition with Joint State by Canetti and Rabin
Universally Composable Notions of Key Exchange and Secure Channels by Canetti and Krawczyk
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions by Canetti, Kushilevitz, and Lindell

Probabilistic polynomial-time process calculus

A Probabilistic Poly-time Framework for Protocol Analysis by Lincoln, Mitchell, Mitchell, and Scedrov
Probabilistic Polynomial-Time Equivalence and Security Protocols by Lincoln, Mitchell, Mitchell, and Scedrov
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols by Ramanathan, Mitchell, Scedrov, and Teague

Fair exchange and contract signing

Impossibility of Distributed Consensus with One Faulty Process by Fischer, Lynch, and Paterson
On the Impossibility of Fair Exchange Without a Trusted Third Party by Pagnia and Gärtner
Optimistic Fair Exchange of Digital Signatures by Asokan, Shoup, and Waidner
Abuse-Free Optimistic Contract Signing by Garay, Jakobsson, and MacKenzie
A Game-Based Verification of Non-Repudiation and Fair Exchange Protocols by Kremer and Raskin
Game Analysis of Abuse-Free Contract Signing by Kremer and Raskin
Finite-State Analysis of Two Contract Signing Protocols by Shmatikov and Mitchell
Contract Signing, Optimism, and Advantage by Chadha, Mitchell, Scedrov, and Shmatikov