Finding Covert Channels in Protocols with Message Sequence Charts: The Case of RMTP2

  • Loic Hélouët
Conference paper

DOI: 10.1007/978-3-540-31810-1_13

Volume 3319 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Hélouët L. (2005) Finding Covert Channels in Protocols with Message Sequence Charts: The Case of RMTP2. In: Amyot D., Williams A.W. (eds) System Analysis and Modeling. SAM 2004. Lecture Notes in Computer Science, vol 3319. Springer, Berlin, Heidelberg

Abstract

Covert channels are illegal information flows in systems. Recent research has shown how to detect covert channels in scenario descriptions. This paper recalls these results, and proposes a case study illustrating how scenarios can be used to detect illegal information flows from a scenario description of a protocol. Once a covert information flow is discovered, its bandwidth is computed using the (max, +) algebra.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Loic Hélouët
    • 1
  1. 1.IRISARennesFrance