Transformations between Cryptographic Protocols

  • Authors:
  • Joshua D. Guttman

  • Affiliations:
  • The MITRE Corporation,

  • Venue:
  • Foundations and Applications of Security Analysis
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A transformation F between protocols associates the messages sent and received by participants in a protocol ${\it\Pi}_1$ with messages sent and received in some ${\it\Pi}_2$. Transformations are useful for modeling protocol design, protocol composition, and the services that protocols provide.A protocol transformation determines a map from partial behaviors ${\mathbb A}_1$ of ${\it\Pi}_1$--which we call "skeletons"--to skeletons $F({\mathbb A}_1)$ of ${\it\Pi}_2$. Good transformations should act as functors, preserving homomorphisms (information-preserving maps) from one ${\it\Pi}_1$-skeleton to another. Thus, if $H:{\mathbb A}_1\mapsto{\mathbb A}_2$ is a homomorphism between ${\it\Pi}_1$-skeletons, then there should be a homomorphism $F(H): F({\mathbb A}_1)\mapsto F({\mathbb A}_2)$ between their images in ${\it\Pi}_2$.We illustrate protocol transformation by examples, and show that our definition ensures that transformations act as functors.