Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T02:35:25.001Z Has data issue: false hasContentIssue false

On the computation of covert channel capacity

Published online by Cambridge University Press:  11 February 2010

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”).

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.)

Article purchase

Temporarily unavailable