Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions

Authors:
Shaddin F. Doghmi;Joshua D. Guttman;F. Javier Thayer
Affiliations:
Stanford University, Stanford, CA, USA;The MITRE Corporation, Bedford, MA, USA;The MITRE Corporation, Bedford, MA, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 7
Cited 4

Using encryption for authentication in large networks of computers

Communications of the ACM
Authentication tests and the structure of bundles

Theoretical Computer Science
Security Goals: Packet Trajectories and Strand Spaces

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
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
Athena: a New Efficient Automatic Checker for Security Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
The faithfulness of abstract protocol analysis: message authentication

Journal of Computer Security - Special issue on ACM conference on computer and communications security, 2001
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

The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Unbounded verification, falsification, and characterization of security protocols by pattern refinement

Proceedings of the 15th ACM conference on Computer and communications security
On weakly cut-stable maps

Information Sciences: an International Journal
Trusted multiplexing of cryptographic protocols

FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms, and shapes. Skeletons model partial information about regular (honest) behavior in an execution of a cryptographic protocol. A homomorphism between skeletons is an information-preserving map. Much protocol analysis may be regarded as an exploration of the properties of the category of skeletons and homomorphisms. A set of skeletons can characterize all runs of the protocol; the smallest such set is the set of shapes. This approach is a foundation for mechanizing protocol analysis.