Searching for shapes in cryptographic protocols

Authors:
Shaddin F. Doghmi;Joshua D. Guttman;F. Javier Thayer
Affiliations:
The MITRE Corporation;The MITRE Corporation;The MITRE Corporation
Venue:
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2007

Citing 13
Cited 21

Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Using encryption for authentication in large networks of computers

Communications of the ACM
Constraint solving for bounded-process cryptographic protocol analysis

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Relations between secrets: two formal analyses of the Yahalom protocol

Journal of Computer Security
Authentication tests and the structure of bundles

Theoretical Computer Science
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Looking for Diamonds in the Desert - Extending Automatic Protocol Generation to Three-Party Authentication and Key Agreement Protocols

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Multiset rewriting and the complexity of bounded security protocols

Journal of Computer Security
Analyzing security protocols with secrecy types and logic programs

Journal of the ACM (JACM)
Decidability of context-explicit security protocols

Journal of Computer Security - Special issue on WITS'03
Types and effects for asymmetric cryptographic protocols

Journal of Computer Security - Special issue on CSFW15
Verification of cryptographic Protocols: tagging enforces termination

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Universally composable symbolic analysis of mutual authentication and key-exchange protocols

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Event Structures with Symmetry

Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus of challenges and responses

Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Breaking and fixing public-key Kerberos

Information and Computation
The CASPA Tool: Causality-Based Abstraction for Security Protocol Analysis

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Rewriting Techniques in the Constraint Solver

Electronic Notes in Theoretical Computer Science (ENTCS)
Cryptographic Protocol Composition via the Authentication Tests

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Adding Branching to the Strand Space Model

Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics and logic for security protocols

Journal of Computer Security
Symmetry and concurrency

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
How to do things with cryptographic protocols

ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Sequential protocol composition in maude-NPA

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
State and Progress in Strand Spaces: Proving Fair Exchange

Journal of Automated Reasoning
Actor-Network procedures

ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Security goals and protocol transformations

TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Events, causality and symmetry

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Analysing applications layered on unilaterally authenticating protocols

FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
Completeness of the authentication tests

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Aluminum: principled scenario exploration through minimality

Proceedings of the 2013 International Conference on Software Engineering
Analysing TLS in the strand spaces model

Journal of Computer Security
Establishing and preserving protocol security goals

Journal of Computer Security - Foundational Aspects of Security
Efficient construction of machine-checked symbolic protocol security proofs

Journal of Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a method for enumerating all essentially different executions possible for a cryptographic protocol. We call them the shapes of the protocol. Naturally occurring protocols have only finitely many, indeed very few shapes. Authentication and secrecy properties are easy to determine from them, as are attacks. cpsa, our Cryptographic Protocol Shape Analyzer, implements the method. In searching for shapes, cpsa starts with some initial behavior, and discovers what shapes are compatible with it. Normally, the initial behavior is the point of view of one participant. The analysis reveals what the other principals must have done, given this participant's view.