Voir la notice de l'article provenant de la source Numdam
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”).
@article{ITA_2010__44_1_37_0, author = {Asarin, Eugene and Dima, C\u{a}t\u{a}lin}, title = {On the computation of covert channel capacity}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {37--58}, publisher = {EDP-Sciences}, volume = {44}, number = {1}, year = {2010}, doi = {10.1051/ita/2010004}, mrnumber = {2604934}, zbl = {1185.94035}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2010004/} }
TY - JOUR AU - Asarin, Eugene AU - Dima, Cătălin TI - On the computation of covert channel capacity JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2010 SP - 37 EP - 58 VL - 44 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita/2010004/ DO - 10.1051/ita/2010004 LA - en ID - ITA_2010__44_1_37_0 ER -
%0 Journal Article %A Asarin, Eugene %A Dima, Cătălin %T On the computation of covert channel capacity %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2010 %P 37-58 %V 44 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita/2010004/ %R 10.1051/ita/2010004 %G en %F ITA_2010__44_1_37_0
Asarin, Eugene; Dima, Cătălin. On the computation of covert channel capacity. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 44 (2010) no. 1, pp. 37-58. doi: 10.1051/ita/2010004
Cité par Sources :