Automatically Calculating Quantitative Integrity Measures for Imperative Programs

  • Tom Chothia
  • Chris Novakovic
  • Rajiv Ranjan Singh
Conference paper

DOI: 10.1007/978-3-319-17016-9_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8872)
Cite this paper as:
Chothia T., Novakovic C., Singh R.R. (2015) Automatically Calculating Quantitative Integrity Measures for Imperative Programs. In: Garcia-Alfaro J. et al. (eds) Data Privacy Management, Autonomous Spontaneous Security, and Security Assurance. Lecture Notes in Computer Science, vol 8872. Springer, Cham

Abstract

This paper presents a framework for calculating measures of data integrity for programs in a small imperative language. We develop a Markov chain semantics for our language which calculates Clarkson and Schneider’s definitions of data contamination and suppression. These definitions are based on conditional mutual information and entropy; we present a result relating them to mutual information, which can be calculated by a number of existing tools. We extend a quantitative information flow tool (CH-IMP) to calculate these measures of integrity and demonstrate this tool with examples based on error correcting codes, the Dining Cryptographers protocol and the attempts by a number of banks to influence the Libor rate.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Tom Chothia
    • 1
  • Chris Novakovic
    • 1
  • Rajiv Ranjan Singh
    • 2
  1. 1.School of Computer ScienceUniversity of BirminghamBirminghamUK
  2. 2.Department of Computer Science, Shyam Lal CollegeUniversity of DelhiNew DelhiIndia

Personalised recommendations