Geodesic
Criterion for the existence of a consistent protocol in a partial erasure channel
Čebyševskij sbornik, Tome 22 (2021) no. 1, pp. 133-151.

Voir la notice de l'article provenant de la source Math-Net.Ru

Covert channels allow one to transmit information using mechanisms that were not originally intended for transmission. An example is a process in which a transmitter encodes information in moves of a character of a multiplayer game, and a receiver observes the moves and decodes the original message. This channel may be noisy, since the character may fall out of the receiver's sight, a number of network packets may be lost, etc. Thus there emerges a natural problem of ogranizing a reliable channel. We propose a formal model called a partial erasure channel that describes the interaction of a transmitter and a receiver, introduce the notion of a consistent transmission protocol, formulate and prove the consistency criterion on the transmitting side and construct the optimal receiver for the given consistent transmitter.
Keywords: covert channels, partial erasure channels, information transmission protocol. 
@article{CHEB_2021_22_1_a9,
     author = {I. B. Kazakov},
     title = {Criterion for the existence of a consistent protocol in a partial erasure channel},
     journal = {\v{C}eby\v{s}evskij sbornik},
     pages = {133--151},
     publisher = {mathdoc},
     volume = {22},
     number = {1},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/CHEB_2021_22_1_a9/}
}
TY  - JOUR
AU  - I. B. Kazakov
TI  - Criterion for the existence of a consistent protocol in a partial erasure channel
JO  - Čebyševskij sbornik
PY  - 2021
SP  - 133
EP  - 151
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CHEB_2021_22_1_a9/
LA  - ru
ID  - CHEB_2021_22_1_a9
ER  - 
%0 Journal Article
%A I. B. Kazakov
%T Criterion for the existence of a consistent protocol in a partial erasure channel
%J Čebyševskij sbornik
%D 2021
%P 133-151
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CHEB_2021_22_1_a9/
%G ru
%F CHEB_2021_22_1_a9
I. B. Kazakov. Criterion for the existence of a consistent protocol in a partial erasure channel. Čebyševskij sbornik, Tome 22 (2021) no. 1, pp. 133-151. http://geodesic.mathdoc.fr/item/CHEB_2021_22_1_a9/

[1] Galatenko A. V., “O skrytykh kanalakh i ne tolko”, Jet Info, 14:114 (2002), 12–20

[2] Epishkina A. V., Kogos K. G., “Ob otsenke propusknoi sposobnosti skrytykh informatsionnykh kanalov, osnovannykh na izmenenii dlin peredavaemykh paketov”, Informatsiya i kosmos, 2015, no. 4, 78–82

[3] Kazakov I. B., “Kodirovanie v skrytom kanale perestanovki paketov”, Programmnaya inzheneriya, 9:4 (2018), 163–173

[4] Kazakov I. B., “Struktura grafa na mnozhestve perestanovok $S_n$, zadavaemaya modelyu oshibki v skrytom kanale perestanovki paketov”, Intellektualnye sistemy. Teoriya i prilozheniya, 22:2 (2018), 53–79

[5] Kazakov I. B., “Raznostnyi kod i protokol tsiklicheskoi poblochnoi peredachi v skrytom kanale po pamyati”, Programmnaya inzheneriya, 10:5 (2019), 204–218 | MR

[6] Kazakov I. B., “Kriterii nadezhnosti kanala s zaprescheniyami”, Intellektualnye sistemy. Teoriya i prilozheniya, 23:2 (2019), 33–55

[7] Kazakov I. B., “Peredacha informatsii v kanalakh, zadavaemykh strukturami chastichnogo stiraniya. Chast 1”, Programmnaya inzheneriya, 11:5 (2020), 277–284

[8] Kazakov I. B., “Peredacha informatsii v kanalakh, zadavaemykh strukturami chastichnogo stiraniya. Chast 2”, Programmnaya inzheneriya, 11:6 (2020), 322–329

[9] Timonina E. E., “Skrytye kanaly (obzor)”, Jet Info, 14:114 (2002), 3–11

[10] Ahsan K., Kundur D., “Practical data hiding in TCP/IP”, Proceedings of Multimedia and Security Workshop at ACM Multimedia, 2002

[11] Berk, V., Giani A., Cybenko G., Detection of covert channel encoding in network packet delays, Technical report TR2005-536, 2005, 11 pp.

[12] Bovy C.J., Mertodimedjo H.T., Hooghiemstra G., Uijterwaal H., Mieghem P., “Analysis of end-to-end delay measurements in Internet”, Proc. 3rd Int. Workshop on Passive and Active Network Measurement, 2002, 1–8 | MR

[13] Gallager R. G., Information Theory and Reliable Communications, John Wiley and Sons Inc, New York, 1968, 604 pp.

[14] Handel T., Sandford M., “Hiding data in the OSI network model”, Proc. of the first International workshop on information hiding, 1996, 23–38 | DOI

[15] Lampson B. W., “A note on the confinement problem”, Communications of ACM, 16:10 (1973), 613–615 | DOI

[16] Lipner S. B., “A Comment on the Confinement Problem”, Proceedings of the Fifth ACM Symposium on Operating Systems Principles, 9:5 (1975), 192–196 | DOI

[17] McFarland J., Covert Channels: An Overview, Preprint, 2017

[18] Murdoch S., Zielinski P., “Covert Channels for Collusion in Online Computer Games”, IH'04: Proceedings of the 6th international conference on Information Hiding, 2004, 355–369

[19] Salwan N., Singh S., Arora S., Singh A., An Insight to Covert Channels, arXiv: 1306.2252

[20] Sellke S. H., Wang C. C., Bagchi S., Shroff N. B., “Covert TCP/IP timing channels: theory to implementation”, Proc. of the twenty-eighth Conference on computer communications, 2009, 2204–2212

[21] Wendzel S., Zander S., Fechner B., Herdin C., “Pattern-Based Survey and Categorization of Network Covert Channel Techniques”, ACM Comput. Surv., 47 (2015), 50:1–50:26 | DOI

[22] Yao L., Zi X., Pan L., Li J., “A study of on/off timing channel based on packet delay distribution”, Computers and security, 28:8 (2009), 785–794 | DOI

[23] Zander S., Armitage G., Branch P., “Covert channels in the IP time to live field”, Proc. of the 2006 Australian telecommunication networks and applications conference, 2006, 298–302

[24] Zander S., Armitage G., Branch P., “A survey of covert channels and countermeasures in computer network protocols”, IEEE Communications Surveys Tutorials, 9 (2007), 44–57 | DOI

[25] Zander S., Armitage G., Branch P., “Covert channels in multiplayer first person shooter online games”, Proc. 33rd IEEE Conf. LCN, 2008, 215–222