Criterion for the existence of a consistent protocol in a partial erasure channel
https://doi.org/10.22405/2226-8383-2021-22-1-133-151
Abstract
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.
References
1. Galatenko, A. V. 2002, «On covert channels and not only», Jet Info, vol. 14, no. 114. pp. 12 – 20.
2. Epishkina, A. V. & Kogos, К. G. 2015, «On assessing throughput capacity of covert information channels by measuring the length of packets transmitted», Informaciya i kosmos, no. 4, pp. 78 — 82
3. Kazakov, I. B. 2018, «Coding in a covert channel of data packages’ permutations», Programmnaya Ingeneria, vol. 9, no. 4, pp. 163 — 173
4. Kazakov, I. B. 2018, «The structure of a graph induced on the set of permutations Sn by an error model of a covert channel based on packet permutations», Intelligent systems. Theory and
5. applications, vol. 22, no. 2, pp. 53 – 81
6. Kazakov, I. B. 2019, «Difference code and a protocol for сyclic blockwise transmission in a memory-based covert channel», Programmnaya Ingeneria, vol. 10, no. 5, pp. 204 — 218
7. Kazakov, I. B. 2019, «Reliabilty criterion for channels with prohibitions», Intelligent systems.
8. Theory and applications, vol. 23, no. 2, pp. 33 – 55
9. Kazakov, I. B. 2020, «Transmission of information in channels specified by structures of partial erasure (part 1)», Programmnaya Ingeneria, vol. 11, no. 5. pp. 277 – 284
10. Kazakov, I. B. 2020, «Transmission of information in channels specified by structures of partial erasure (part 2)», Programmnaya Ingeneria, vol. 11, no. 6. pp. 322 – 329
11. Timonina, E. E. 2002, «Covert channels (survey)», Jet Info, vol. 14, no. 114, pp. 3 – 11
12. Ahsan, K. & Kundur, D. 2002, «Practical data hiding in TCP/IP», In proceedings of: Multimedia and Security Workshop at ACM Multimedia.
13. Berk, V., Giani, A. & Cybenko, G. 2005, «Detection of covert channel encoding in network packet delays», Technical report TR2005-536, 11 p.
14. Bovy, C.J., Mertodimedjo, H.T., Hooghiemstra, G., Uijterwaal, H. & Mieghem, P. 2002, «Analysis of end-to-end delay measurements in Internet», Proc. 3rd Int. Workshop on Passive
15. and Active Network Measurement, pp. 1 – 8
16. Gallager, R. G. 1968, Information theory and reliable Communications, John Wiley & Sons Inc., New York, 604 p.
17. Handel, T. & Sandford, M. 1996, «Hiding data in the OSI network model», Proc. of the first International workshop on information hiding, pp. 23 – 38
18. Lampson, B. W. 1973, «A note on the confinement problem», Communications of ACM., vol. 16, no. 10, pp. 613 — 615
19. Lipner, S. B. 1975, «A comment on the confinement Problem», Proceedings of the Fifth ACM Symposium on Operating Systems Principles, vol.9, no. 5, pp. 192 — 196
20. McFarland, J. 2017, «Covert channels: an overview», Preprint.
21. Murdoch, S. & Zielinski, P. 2004, «Covert channels for collusion in online computer games», IH’04: Proceedings of the 6th international conference on Information Hiding, pp. 355 – 369
22. Salwan, N., Singh, S., Arora, S. & Singh A. 2013, «An insight to covert channels», arkhiv: 1306.2252
23. Sellke, S. H., Wang, C. C., Bagchi, S. & Shroff, N. B. 2009, «Covert TCP/IP timing channels: theory to implementation», Proc. of the twenty-eighth Conference on computer communications, pp. 2204 – 2212
24. Wendzel, S., Zander, S., Fechner, B. & Herdin C. 2015, «Pattern-based survey and categorization of network covert channel techniques», ACM Comput. Surv., vol. 47, pp. 50:1 – 50:26
25. Yao, L., Zi, X., Pan, L. & Li, J. 2009, «A study of on/off timing channel based on packet delay distribution», Computers and security, vol. 28, no. 8, pp. 785 – 794
26. Zander, S., Armitage, G. & Branch, P. 2006, «Covert channels in the IP time to live field», Proc. of the 2006 Australian telecommunication networks and applications conference. pp. 298 – 302
27. Zander, S., Armitage, G. & Branch, P. 2007, «A survey of covert channels and countermeasures in computer network protocols», IEEE Communications Surveys & Tutorials, vol. 9, pp. 44 –57
28. Zander, S., Armitage, G. & Branch, P. 2008, «Covert channels in multiplayer first person shooter online games», Proc. 33rd IEEE Conf. LCN, pp. 215 – 222
Review
For citations:
Kazakov I.B. Criterion for the existence of a consistent protocol in a partial erasure channel. Chebyshevskii Sbornik. 2021;22(1):133-151. (In Russ.) https://doi.org/10.22405/2226-8383-2021-22-1-133-151
Views:
357
Email this article 