A HOL extension of GNY for automatically analyzing cryptographic protocols

  • Authors:
  • S. H. Brackin

  • Affiliations:
  • -

  • Venue:
  • CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
  • Year:
  • 1996

Quantified Score

Hi-index 0.04

Visualization

Abstract

This paper describes a Higher Order Logic (HOL) theory formalizing an extended version of the Gong, Needham, Yahalom (GNY) belief logic, a theory used by software that automatically proves authentication properties of cryptographic protocols. The theory's extensions to the GNY logic include being able to specify protocol properties at intermediate stages and being able to specify protocols that use multiple encryption and hash operations, message authentication codes, computed values (e.g., hash codes) as keys, and key-exchange algorithms.