Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T19:43:41.112Z Has data issue: false hasContentIssue false
  • English
  • Français

On the computation of covert channel capacity

Published online by Cambridge University Press:  11 February 2010

Eugene Asarin  and
Cătălin Dima
Eugene Asarin
Affiliation:
LIAFA, Université Denis Diderot and CNRS, Case 7014, 75205 Paris Cedex 13, France; asarin@liafa.jussieu.fr
Cătălin Dima
Affiliation:
LACL, Université Paris-Est – Université Paris 12, 61 av. du Général de Gaulle, 94010 Créteil, France; dima@univ-paris12.fr
Get access

Abstract

We address the problem of computing the capacity of a covert channel, modeled as a nondeterministic transducer. We give three possible statements of the notion of “covert channel capacity” and relate the different definitions. We then provide several methods allowing the computation of lower and upper bounds for the capacity of a channel. We show that, in some cases, including the case of input-deterministic channels, the capacity of the channel can be computed exactly (e.g. in the form of “the largest root of some polynomial”).

Keywords

Covert channelsentropysynchronous transducers.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 44 , Issue 1: Special issue dedicated to the 12th "Journées Montoises d'Informatique Théorique" , January 2010 , pp. 37 - 58
Copyright
© EDP Sciences, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

M.-P. Béal, Codage Symbolique. Masson (1993).
Béal, M.-P. and Carton, O., Determinization of transducers over finite and infinite words. Theoretical Computer Science 289 (2002) 225–251. CrossRef
Blondel, V. and Nesterov, Yu., Polynomial-time computation of the joint spectral radius for some sets of nonnegative matrices. SIAM Journal of Matrix Analysis and Applications 31 (2009) 865–876. CrossRef
C. Choffrut and S. Grigorieff, Uniformization of rational relations, in Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, edited by J. Karhumäki, H.A. Maurer, Gh. Paun and G. Rozenberg. Springer (1999) 59–71.
Department of defense trusted computer system evaluation criteria. DOD 5200.28-STD, National Computer Security Center (December 1985).
Frougny, C. and Sakarovitch, J., Synchronisation déterministe des automates à délai borné. Theoretical Computer Science 191 (1998) 61–77. CrossRef
F.R. Gantmacher, The theory of matrices. AMS Chelsea Publishing (1959).
J.A. Goguen and J. Meseguer, Security policies and security models, in Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, USA (1982) 11–20.
Jungers, R., Protasov, Vl. and Blondel, V., Efficient algorithms for deciding the type of growth of products of integer matrices. Linear Algebra and its Applications 428 (2008) 2296–2311. CrossRef
D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995).
G. Lowe, Quantifying information flow, in Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW'02), IEEE Computer Society (2002) 18–31.
J.K. Millen, Finite-state noiseless covert channels, in Proceedings of the 2nd IEEE Computer Security Foundations Workshop (CSFW'89), IEEE Computer Society (1989) 81–86.
V. Protasov, R. Jungers and V. Blondel, Joint spectral characteristics of matrices: a conic programming approach. http://www.inma.ucl.ac.be/~jungers/publis_dispo/conic.pdf (2009).
W. Thomas, Languages, automata, and logic, in Handbook of Formal Languages, Vol. III. Springer Verlag (1997) 389–455.
Turán, P., On an extremal problem in graph theory. Matematicko Fizicki Lapok 48 (1941) 436–452 (in Hungarian).
J.T. Wittbold and D.M. Johnson, Information flow in nondeterministic systems, in IEEE Symposium on Security and Privacy (1990) 144–161.