Automated security proof for symmetric encryption modes

  • Authors:
  • Martin Gagné;Pascal Lafourcade;Yassine Lakhnech;Reihaneh Safavi-Naini

  • Affiliations:
  • Department of Computer Science, University of Calgary, Canada;Université Grenoble 1, CNRS, VERIMAG, France;Université Grenoble 1, CNRS, VERIMAG, France;Department of Computer Science, University of Calgary, Canada

  • Venue:
  • ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to specify encryption modes and an assertion language that allows to state invariants and axioms and rules to establish such invariants. The assertion language consists of few atomic predicates. We were able to use our method to verify semantic security of several encryption modes including Cipher Block Chaining (CBC), Cipher Feedback mode (CFB), Output Feedback (OFB), and Counter mode (CTR).