Using Temporal Logic to Specify and Verify Cryptographic Protocols (Progress Report)

Abstract

We use standard linear-time temporal logic to specify cryptographic protocols, model the system penetrator, and specify correctness requirements. The requirements are specified as standard safety properties, for which standard proof techniques apply. In particular, we are able to prove that the system penetrator cannot obtain a session key by any logical or algebraic techniques. We compare our work to Meadows' method. We argue that using standard temporal logic provides greater flexibility and generality, firmer foundations, easier integration with other formal methods, and greater confidence in the verification results.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1995
Accession Number
ADA465044

Entities

People

  • James W. Gray Iii
  • John A. McLean

Organizations

  • Hong Kong University of Science and Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Authentication
  • Communication Networks
  • Computations
  • Computer Science
  • Computers
  • Cryptography
  • Cybersecurity
  • Equations
  • Formal Languages
  • Hong Kong
  • Language
  • Notation
  • Security Protocols
  • Standards
  • Theorems
  • Theoretical Computer Science

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Artificial Intelligence
  • Computational Linguistics
  • Systems Analysis and Design