Formal analysis of modern security protocols

  • Authors:
  • Alec Yasinsac;Justin Childs

  • Affiliations:
  • Computer Science Department, Florida State University, 253 Love Bldg, Tallahassee, FL;Computer Science Department, Florida State University, 253 Love Bldg, Tallahassee, FL

  • Venue:
  • Information Sciences—Informatics and Computer Science: An International Journal
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Analyzing security protocols is notoriously difficult. In this paper, we show how a novel tool for analyzing classical cryptographic protocols can be used to model and analyze complex Internet security protocol families. CPAL-ES allows the representation of the interaction between two sub-protocols. Within a protocol such as Transport Layer Security (TLS) these are selected from a collection of sub-protocols utilized by a principal. Modeling subversion related to sub-protocol interactions is an important part of formally understanding attacks upon protocol suites. The CPAL environment contains sufficient functionality to verify the feasibility of these attacks.We also define and classify the characteristics that add complexity to modern security protocol and some impacts this complexity has on security protocol analysis. Finally, we discuss the modifications that were necessary in our formal method tool to answer this complexity and show how the tool illuminates flaws in the TLS protocol.