Abstracting Cryptographic Protocols with Tree Automata

  • Authors:
  • David Monniaux

  • Affiliations:
  • -

  • Venue:
  • SAS '99 Proceedings of the 6th International Symposium on Static Analysis
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cryptographic protocols have so far been analyzed for the most part by means of testing (which does not yield proofs of secrecy) and theorem proving (costly). We propose a new, abstract interpretation based, approach, using regular tree languages. The abstraction we use seems fine-grained enough to be able to certify some protocols. Both the concrete and abstract semantics of the protocol description language and implementation issues are discussed in the paper.