A bandwidth computation model for covert storage channels and its applications

  • Authors:
  • Chii-Ren Tsai;Virgil D. Gligor

  • Affiliations:
  • VDG, Inc., Chevy Chase, Maryland and Department of Electrical Engineering, University of Maryland, College Park, Maryland;Department of Electrical Engineering, University of Maryland, College Park, Maryland

  • Venue:
  • SP'88 Proceedings of the 1988 IEEE conference on Security and privacy
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most practical policies for handling covert storage channels are based on bandwidth-limitation techniques. In this paper we present a Markov model for bandwidth computation and its application to Secure Xenix. The model can be used for computing the bandwidth of both individual channels and aggregated channels (i.e., serial and parallel aggregation). Based on this model, a tool has been built and experiments conducted to determine the factors that affect the bandwidth of covert storage channels (i.e., noise, scheduling delays, load, "think times"). The tool can be used to compute the minimum delays for each channel under various loads and program behavior. Thus, it enables the placement dynamically-adjustable delays in multiprogrammed systems, which guarantees minimum performance impact.