Geodesic
Estimation of the time required to organize a secret channel
Diskretnaya Matematika, Tome 15 (2003) no. 2, pp. 40-46
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In this study, we construct the mathematical model of a covert channel of agent interaction in the wide area network and in a closed segment of a local area network. The channel transmits information through an IPsec-based protective device with the use of encapsulation and enciphering of packets. We analyse the asymptotic behaviour of the time needed to learn the agent the language of information transmission. We prove that if the number $n$ of nodes in an arbitrary segment and the number $m$ of segments grow without limits, then the learning time is $O(m^2n\ln n)$ under some conditions.This research was supported by the Russian Foundation for Basic Research, grant 01–01–00895. 
@article{DM_2003_15_2_a1,
     author = {A. A. Grusho and E. E. Timonina},
     title = {Estimation of the time required to organize a secret channel},
     journal = {Diskretnaya Matematika},
     pages = {40--46},
     year = {2003},
     volume = {15},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2003_15_2_a1/}
}
TY  - JOUR
AU  - A. A. Grusho
AU  - E. E. Timonina
TI  - Estimation of the time required to organize a secret channel
JO  - Diskretnaya Matematika
PY  - 2003
SP  - 40
EP  - 46
VL  - 15
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_2003_15_2_a1/
LA  - ru
ID  - DM_2003_15_2_a1
ER  - 
%0 Journal Article
%A A. A. Grusho
%A E. E. Timonina
%T Estimation of the time required to organize a secret channel
%J Diskretnaya Matematika
%D 2003
%P 40-46
%V 15
%N 2
%U http://geodesic.mathdoc.fr/item/DM_2003_15_2_a1/
%G ru
%F DM_2003_15_2_a1
A. A. Grusho; E. E. Timonina. Estimation of the time required to organize a secret channel. Diskretnaya Matematika, Tome 15 (2003) no. 2, pp. 40-46. http://geodesic.mathdoc.fr/item/DM_2003_15_2_a1/

[1] Kramer G., Matematicheskie metody statistiki, Mir, Moskva, 1975 | MR

[2] Timonina E. E., “Skrytye kanaly (obzor)”, JetInfo, 2002, no. 11, 3–11

[3] Ahsan K., Kundur D., Practical data hiding in TCP/IP, Workshop Multimedia and Security ACM Multimedia'02, French Riviera, Juan-les-Pins, 2002

[4] Ajtai M., Komlos J., Szemeredi E., “The longest path in a random graph”, Combinatorica, 1 (1981), 1–12 | DOI | MR | Zbl

[5] A guide to understanding covert channel analysis of trusted systems, NCSC TG-030, National Computer Security Center, Fort George G. Meade, Maryland 20755-6000, 1993