CC BY
11
METHOD FOR CALCULATION MAXIMUM THROUGHPUT HIDDEN CHANNELS IN SYSTEMS OF STEGANOGRAPHIC
COMMUNICATIONS
DOI: 10.36724/2072-8735-2022-16-9-40-45
Manuscript received 02 August 2022; Accepted 30 August 2022
Bayram G. Ib^himov,
Azerbaijan Technical University, Baku, Azerbaijan, i.bayram@mail.ru
Konul M. Tahirova,
National Defense University, Baku, Azerbaijan, konul_tahirova@yahoo.com
Keywords: steganographic system, covert channel, packet length, steganographic communication quality, countermeasures, efficiency, residual throughput
An analysis of the performance indicators multiservice telecommunication networks using the sixth technological order based on the NGN (Next Generation Network) architectural concept and future FN (Future Networks) networks was carried out to build high-performance steganographic systems with increased covert channels throughput, ensuring the achievement of a certain level information security. Comprehensive criteria for the efficiency the functioning stegano-graphic systems are considered and the channel capacity of the steganosystem as a communication system with packet switching is selected. On the basis of the study, a new approach to constructing a method for evaluating complex indicators of the quality of steganographic communication during embedding and extracting hidden data is proposed. The quality of steganographic communication refers to the properties stegano communication to ensure the efficiency of the system, both timely and reliable transmission of messages. On the basis of the proposed approach, the effectiveness steganographic systems in the construction of covert channels for the transmission secret data transmitted over communication channels was studied. Taking into account the new entropy approach, a method for calculating the indicators of the latent throughput steganographic systems in packet-
switched communication networks has been created. As a result of the study calculation method, important analytical expressions were obtained for evaluating complex indicators throughput steganograph-ic systems, such as the throughput of covert channels, the maximum possible value of the performance of a binary source packets, the average packet transmission time with the proposed coding scheme, and the residual throughput of the communication channel. Based on the results obtained, covert channel performance in steganographic systems was simulated using the Communications Toolbox package, an extension of the standard Matlab environment designed for calculating and modeling communication systems. The table contains indicators of the residual throughput of the system and the parameters of covert channel, taking into account the lengths of the headers of the network and channel levels of the open systems interaction models. With the considered method counteraction, a graphical dependence of the maximum value residual system throughput on the covert channel parameter is plotted. On the basis of the analysis, actual problems are identified, recommendations are developed to improve the efficiency of the use steganographic systems architectures for multiservice telecommunication networks.
Information about authors:
Bayram G. Ibmhimov, Doctor of Technical Sciences, professor, Azerbaijan Technical University, Baku, Azerbaijan Konul M. Tahirova, Adjunct of the National Defense University, Baku, Azerbaijan
Для цитирования:
Ибрагимов Б.Г., Тахирова КМ. Метод расчета показателей максимальной пропускной способности скрытых каналов в системах стеганографических связи // T-Comm: Телекоммуникации и транспорт. 2022. Том 16. №9. С. 40-45.
For citation:
Ibrahimov B.G., Tahirova K.M. (2022) Method for calculation maximum throughput hidden channels in systems of steganographic communications. T-Comm, vol. 16, no.9, pр. 40-45. (in Russian)
Introduction
The intensive development of multiservice telecommunication networks based on the concepts of the digital economy, the Fourth Industrial Revolution and the sixth technological order requires the construction steganographic systems with increased capacity of covert channels, ensuring the achievement of a certain level information security.
The studies carried out in [1, 2, 3] show that multiservice telecommunication networks based on the architectural concepts of the next NGN and future FN generations are today a particularly vulnerable place for information security violations. In this case, it is impossible to guarantee the safety of data during their passage through public media such as electrical and optical communication channels, the Internet, terrestrial, wireless, and space channels. Therefore, messages transmitted over various telecommunication channels using advanced technologies are in particular need to protect information from unauthorized subscriber and network access.
Currently, there are two main directions in solving the problem of protecting information from unauthorized access [1-5]: cryptography and steganography. The purpose of cryptography is to hide the content of a message through encryption. Steganography hides the very fact of the existence and transmission of a secret message through covert channels. In this case, not only is the fact of forwarding some secret message from Alice to Bob hidden, but Eve does not even know that Alice is communicating withBob.
The construction of covert channels and ensuring the security of information using the methods, algorithms and tools steganographic systems is an extremely urgent task in telecommunication systems [1,4,6].
Thus, steganography studies the methods by which the very fact of the transmission multimedia type information is concealed. The studied methods have shown [1, 4, 6, 7] that steganography allows not only covert transmission multimedia data
Éf , but also to solve the problems of noise-immune authentication, protection of information from unauthorized subscriber and network access, tracking the dissemination information over multiservice telecommunication networks, information search in multimedia databases.
The analysis of publications devoted to steganography allows us to single out works [1-3] published in the territory of the CIS (Countries of Independent States) and foreign countries as the base ones both in terms time of their publication, the number citations, the volume of the material presented, and in terms of the number analyzed and systematized literature sources on selected problem [4-8]. These works outline the approaches, principles and tasks steganography and steganalysis as a communication system [9-12]. There are also known approaches to estimating the capacity of covert channels with noise using information theory methods [6, 8, 13, 14]
In this paper, we consider the problem of studying the principle constructing covert channels in multi-service packet-switched telecommunication networks with the introduction methods for countering and estimating the indicators maximum throughput.
Statement of the research problem.
It is known [1, 4, 6, 7] that information is presented in the form messages and transmitted in the form of a sequence characters. From the source to the receiver, the message is transmitted through some material medium, which is a communication channel. In steganographic systems, a discrete channel is widely used -this is a communication channel used to transmit discrete messages. Usually, a discrete channel is a set technical means that ensure the transmission of a digital signal. On the basis of a discrete channel, a covert communication channel is implemented to transmit secret messages in the form of a container package [1].
It should be noted that a covert channel is a telecommunications communication channel that sends information using a different method and algorithm, which was not originally intended for this [1, 8]. It is generally accepted that a covert channel is a kind disguised, unauthorized transmission messages to a third party that violates the system security policy. However, covert channels can also be used by authorized users using steganographic methods and algorithms, which are based on the features of the presentation messages transmitted to communication channels [1, 3, 4, 5].
In this case, a hidden message of a multimedia type means a variety of methods that modify data and programs, text, audio and video. Strictly speaking, this variant refers to hiding information in text documents, hiding data in speech messages and hiding information in video data or moving images (Data, Audio, Video - D, A, V). Covert channel stegomethods use mainly text, audio and video data as a container.
Due to the fact that the organization of hidden attachments is possible mainly due to the redundancy of the type data that is chosen by the carrier, the popularity of using audio and video data for this task is obvious, as the most redundant. Then, when using container packet technology, the length of the hidden message multimedia type is expressed as
LMk =2 = LDlk + L*k + L{k, i = 1^ (1)
i=1
Based on (1), we assume that during the transmission of hidden information in voice messages 20 ms , a packet is formed from 160 bayt, every time one information Atk = 125 mks is written to the container 1 bayt. Therefore, instead of streams of traffic packets, streams of containerpackets are considered [11].
In multiservice networks with packet switching, covert channels are widely used technologies and protocol stack MPLS (Multiprotocol Label Switching) TCP/IP (Transport Control Protocol/Internet Protocol) and IP/MPLS(Internet Protocol/MPLS). The IP/MPLS header consists of several labels, like a service packet.
Research and evaluation of the effectiveness steganographic systems
One of the important criteria for the effectiveness of the functioning steganographic systems is the channel bandwidth of the steganosystem as a communication system with packet switching and is described by the following relationship:
.Lr) = W [crax(A,,\k)], / = 1,K,
(2)
where (Ai, Li ) - functions that take into account the performance indicators of the functioning steganographic systems as communication systems, taking into account the rate arrival of the incoming stream when transmitting the stream of the i-th packet of the traffic container with the length of the hidden message Li, i = 1, K ; C^fax (Li k ,Àik ) - the maximum value of the throughput covert channel steganographic packet switched systems, taking into account the speed of the incoming stream Ài k when transmitting a stream i - th container packets with length Lik, i = 1, K . The latter is determined by three indicators of the bandwidth of the channels of the steganosystem as a communication system:
Qiax m.k ' \.k ) = Qiax ' A ) _ Qiax (An ' An ) _ Qiax (Ac ' Ac) ' i = KK, (3)
where C^x(2i, Li) - total maximum throughput of a communication system using packet-switched steganography systems, taking into account the incoming flow rates Ai when transmitting the stream of the i - th packet with length Lt, i = 1, K ;
CUA«, 4«) and QL(AC, 4.c) " respectively, the channel capacity of the communication system using steganographic systems (information or useful and service channels), taking into account the speed of the incoming stream n and c when transmitting the stream of the i-th packet with length
k.nandhc •
Expressions (1), (2) and (3) characterize the general essence of the efficiency of a steganographic system, taking into account the parameters of the packets, indicators useful, service and covert communication channels, which make it possible to describe the considered new approach to constructing a method for assessing the quality of steganosystem when embedding and extracting hidden data.
Analysis of indicators residual system throughput
To build a covert channel, a counteraction method was used based on changing the length of each transmitted packet (useful and service), which has a uniform distribution on the set
Naf U {0}, which create an additional load on the common
communication channel. An important question that arises in this case is the estimation of the residual throughput steganographic systems when introducing a method for changing the field of a useful and service packet of a hidden message and is equal to:
Cokc (21 ^ _
crx(4„) = . m: , n('l)■ (4n + A,). = 1.*. (4)
i.n cnyV i)
where Lcny (Ai) - the length of the service transmitted packet,
taking into account the protocol unit and the control field of the information packet network and link level of the model.
Expression (4) characterizes the residual capacity steganographic systems with the introduction of the method changing the field of the useful and service packet of the covert message and determines the potential of the covert channel.
Taking into account the uniform distribution of the symbol transmitted over the covert channel (due to the largest uncertainty - entropy) and the parameter of the counteraction approach
at, expression (4) will take the following form [6, 8, 9]:
Cres (T ) -
max V^i.n)
i = 1, K
c^M, A- )
E[ Lt ] + Làà (k ) + 0,5 ai
■ E[ Lt L
(5)
where E[Li ] - average length of total transmitted packets over a communication channel; af — the number of code element in
the implementation dummy bits per packet, determined by the values of a random variable that has a uniform distribution on the
set Naf U {0}.
Expression (5) determines the loss of the total throughput network steganography as a communication system when using the countermeasure method.
Among the ways to counter information leakage through network covert channels, it is customary to single out detection, elimination, and throughput limitation [3,8].
Based on the entropy approach in the absence of restrictions
on the value of the variance a2 for a uniform distribution F (x) = 1 / (e — a) has the maximum entropy
Hvmax = iog2 (e - a) . Given the last assumption and the duration of the transmission of one message i-th packets T(Ai) , the
maximum possible value of the performance of the packet source is determined as follows:
c ) - [Hvmax / T)] < (Li k, Ai k ) ;
i = TK
«.max v "i >
(6)
The fulfillment condition (6) means that the system has a method for optimal coding and decoding data (an efficient method modulation and coding, a signal-code design) transmitted via covert channels, in which the error probability is arbitrarily small
PbKer ^ 0 ,HV (U) = 0
Based on the new approach and using expressions (6), we obtain in a compact form the formula for the maximum value of the covert channel throughput:
Cck (L ; . = £°glLyy (k) . —
maxl ' ) E[Tn (At, Lt )]
i = 1, K
(7)
Expression (7) takes into account the indicators of covert channel, the lengths of the network and link layer headers open systems interaction model and is described in a very compact
way in comparison with the works obtained by the formula for the covert channel throughput [8, 13].
For engineering calculation, taking into account covert channel indicators af and L (k) , and also with the considered
method counteraction, the residual channel throughput is as follows:
Ces (L Ï =
max V i.n'
i = 1, K
2C£(4. A- )
2E[Li] + L (k+1)
• E[ Li ],
(8)
Parameters of covert channel and protocol stack IP/MPLS steganography system E [Lt ], byte 64 100 128 256 328 400 512 640
C^, Ll)' Kbyte /s 64 128 512 1024 2048 4096 8192 16384
L„ (k )> byte 5 10 15 20 25 30 32 35
C" <r V i.n)' Kbyte /s 55,35 35,16 91,43 50,69 330,99 55,28 736,36 199,58 1466,69 217,36 2925,71 314,32 5637,51 604,54 11335,96 1114,62
Relative residual capacity )> % 63,52 55,44 16,70 15,10 14,82 10,74 10,72 9,83
The analysis shows that Table 1 shows the important values of covert channel indicators, the total maximum value communication channel throughput for some values of the countermeasure
method parameter af and the average length of the total transmitted packets over the communication channel.
Thus, from numerical calculations it follows that with an increase in the parameters of the covert channel and the IP/MPLS protocol stack of the steganography system, the maximum value of the residual throughput of the system increases, which meets the requirements for the quality of steganographic communication.
Based on the results modeling covert channel indicators, Fig. 1 plots a graphical dependence of the maximum value of the residual system throughput on the covert channel parameter for a given indicator of packet-switched communication networks.
Graphical dependency analysis
Cres (L ) = F{CokcU.,L ),af, E\L 1} indicates that an increase in the covert channel parameter af, leads to a decrease ) ^ (2000,..., 1960) Kbps a system that meets the
quality requirements of steganographic communication when using methods to counter the specified type covert of channels, by randomly changing the parameters packets and communication channels.
In addition, from Figure 1 it follows that the desired value
Lin) and its noticeable change begins with the values
Expression (8) determines the maximum value of the loss of the total throughput communication channel. In addition, (8) determines the capabilities of the steganography system in the transmission secret data, the efficiency use and potential resources of the covert channel.
Numerical results and interpretation
On the basis of the calculation method, a numerical assessment was made by modeling covert channel indicators in steganographic systems using the Communications Toolbox package - an extension of the standard Matlab environment, R 2019b, designed for calculating and modeling communication systems. The results obtained are explicitly listed in table 1.
Table 1
Residual system throughput and covert channel parameters for af = (16,...,500)bit
a* > (100,...,150)
bit
at E[Ll ] > 2000 bit
and
CtW, A ) ^ 2048Kbps.
■A Figure 1
File Edit View Insert Tools Desktop Window Help
□ ê d ^ I S DE fed
M
" 2000
-g 1980
= 'WXOKbps
>gt>6 liil -^ils]
w
0 50 100 150 200 250
O'i.'vcrl channel parameter , alfa .'-S, r"it"
Fig. 1. Graphic dependence ofthe maximum value ofthe residual throughput system on the parameter covert channel packet switched communication networks
Efficiency use and distribution throughput system resources steganographic systems
Based on the method calculation and analysis (3), it is possible to determine the maximum value of the covert channel bandwidth steganographic packet-switched systems:
Qnax (A'.fc ' ^i.k ) _ Qnax ' ^i.k ) Qnax (A.n ) =
i = T~K
(9)
One of the criteria that allows one to compare the efficiency allocating bandwidth resources of covert data transmission systems is the ratio (Lt n) to the total throughput communica-
res
max i.n '
okc
max V' '
tion systems , Lt ):
C.
A Q( A-.„ ) = i -
res max v"i.n
} / = l, k .
Cmax (4 > Li.k )
(10)
7TY
Expressions (9) and (10) allow estimating the channel resources, temporal and informative characteristics of the covert channel of steganographic systems.
Thus, the performed analysis shows that the possible scenarios for the efficient use of covert channel resources in network steganography are not limited to those described in this section.
Conclusions
As a result of the study, a new approach was proposed to create a method for calculating the throughput of covert channel steganographic systems, taking into account the performance indicators packet switched communication networks, methods counteraction control and distribution communication channel resources.
On the basis of the calculation method, analytical expressions were obtained for estimating the indicators of the residual system throughput and the average packet transmission time, taking into account the covert channel parameter and the IP/MPLS protocol stack of the steganography system.
The indicators Table 1 and the graphic dependence of the maximum residual throughput on the covert channel parameter are analyzed.
It has been established that a strong dependence of covert
channel throughput (Lin ) of the total number parameters af , E[Li ] and Z (k) is the main disadvantage steganographic systems using a packet switched communication network and this countermeasure method.
As a result, the throughput of the covert channel, the reliability network operation and protection against unauthorized access along the perimeter subscriber and network communication lines are significantly reduced.
References
1. O.I. Shelukhin, S.D. Kanaev (2018). Steganography. Algorithms and software implementation / Ed. Professor O.I. Shelukhin. Moscow: Hotline - Telecom. 592 p.
2. V.I. Korzhik, V.A. Yakovlev (2016). Fundamentals of cryptography: SP.: NTs Intermedia. 296 p.
3. B.G. Ibrahimov, E.M. Jafarova (2019). Analysis of information security methods in telecommunication systems using quantum cryptography. Proceedings of the VIII International Conference "Technical Universities: Integration -with European and World Education Systems. Izhevsk TU. Russia, Izhevsk, pp. 404-410.
4. B.Ya. Ryabko, A.N. Fionov (2020). Fundamentals modern cryptography and steganography. Moscow: Hotline -Telecom. 232 p.
5. G.F. Konakhovich, A.Yu. Puzyrenko (2006). Computer Steganography: Theory and Practice. Kiev: MK-Press. 288 p.
6. B.G. Ibrahimov, K.M. Takhirova (2021). Analysis of information security indicators based on network steganography technology. Collection of scientific articles - X-International scientific-technical and scientific-methodical conference "Actual problems of infotelecommunications in science and education". SPb.: SPbGUT. Vol. 1, pp. 411-416.
7. V.I. Korzhik, K.A. Nebaeva, M. Alekseevs (2013). Use of a noisy channel model for constructing a stegosystem. Telecommunications. No. 7, pp. 33-36.
8. A.I. Belozubova, KG. Kogos, P.V. Lebedev (2021). Network covert channels capacity limitation by adding random delays before packet sending. IT Security. Vol. 28. No. 4, pp. 74-89.
9. K. Ahsan, D. Kundur (2002). Practical Data Hiding in TCP/IP. Proceedings of the ACM Workshop on Multimedia Security. 2002, pp. 866-870.
10. S. Cabuk, C.E. Brodley, C. Shields (2004). IP covert timing channels: design and detection. Proceedings of the eleventh ACM conference on computerand communications security, pp. 178-187.
11. A.P. Pshenichnikov (2017). The theory of teletraffic: Moscow: Hotline - Telecom, 2017.212 p.
12. A.A. Grusho (1999). On the existence of hidden channels. Discrete Mathematics. Vol.11. No. 1, pp. 24-28.
13. B.W. Lampson (1973). A Note on the Confinement Problem. Communications oftheACM, pp. 613-615.
14. Jonatha Anselmi, Neil Walton. Stability and Optimization of Speculative Queueing Networks. IEEE/ACM Transactions on Networking, IEEE/ACM, 2021,pp.l-12.
7TT
T-Comm Tом 16. #9-2022
МЕТОД РАСЧЕТА ПОКАЗАТЕЛЕЙ МАКСИМАЛЬНОМ ПРОПУСКНОЙ СПОСОБНОСТИ СКРЫТЫХ КАНАЛОВ В СИСТЕМАХ СТЕГАНОГРАФИЧЕСКИХ СВЯЗИ
Ибрагимов Байрам Ганимат оглы, Азербайджанский Технический Университет, Баку, Азербайджан, i.bayram@mail.ru Тахирова Конул Мамед кызы, Университет Национальной Обороны, Баку, Азербайджан, konul_tahirova@yahoo.com
Аннотация
Проведен анализ показателей эффективности мультисервисных телекоммуникационных сетей с использованием шестого технологического уклада на базе архитектурной концепции NGN (Next Generation Network) и будущих сетей FN (Future Networks), для построения высокоэффективных стеганографических систем с повышенной пропускной способностью скрытых каналов, обеспечивающие достижение определенного уровня информационной безопасности. Рассмотрены комплексные критерии эффективности функционирования стеганографических систем и выбрана пропускная способность канала стеганосистемы как системы связи с коммутацией пакетов. На основе исследования предложен новый подход к построению метода оценки комплексных показателей качества работы стеганографической связи при встраивании и при извлечении скрытых данных. На базе предложенного подхода исследованы эффективности стеганографических систем при построении скрытых каналов для передачи секретных данных, передаваемых по каналам связи. Учитывая новый энтропийный подход создан метод расчета показателей скрытой пропускной способности стеганографических систем в сетях связи с коммутацией пакетов. В результате исследования метода расчета получены важные аналитические выражения, для оценки комплексных показателей максимальной пропускной способности стеганографических систем как пропускная способность скрытых каналов, при предложенной схеме кодирования так и остаточная пропускная способность канала связи. На основе полученных результатов проведено моделирование показателей скрытых каналов в стеганографических системах с использованием пакета Communications Toolbox - расширение стандартной среды Matlab, предназначенное для расчета и моделирования систем связи. В таблицу внесены показатели остаточной пропускной способности системы и параметры скрытого канала с учетом длин заголовков сетевого и канального уровней моделей взаимодействия открытых систем.
Ключевые слова: стеганографическая система, скрытый канал, длина пакета, качество стеганографической связи, противодействие, эффективность, остаточная пропускная способность.
Литература
1. Шелухин О.И., Канаев С.Д. Стеганография. Алгоритмы и программная реализация/ Под ред. профессора О.И.Шелухина. М.: Горячая линия -Телеком, 2018. 592 с.
2. Коржик В. И., Яковлев В. А. Основы криптографии: СПб.:НЦ Интермедиа, 2016. 296 с.
3. Ибрагимов Б.Г., Джафарова Э.М. Анализ методов информационной безопасности в системах телекоммуникаций с использованием квантовой криптографии // Материалы VIII Международной конференции "Технические университеты: интеграция с европейскими и мировыми системами образования". Ижевский ТУ. Россия, Ижевск, 2019. С. 404-410.
4. Рябко Б.Я., Фионов А.Н. Основы современной криптографии и стеганогрфии. М.: Горячая линия - Телеком, 2020. 232 с.
5. Конахович Г.Ф., Пузыренко А.Ю. Компьютерная стеганография: теория и практика. Киев: МК-Пресс, 2006. 288 с.
6. Ибрагимов Б.Г., Тахирова К.М. Анализ показателей информационной безопасности на базе технологии сетевой стеганографии // Сборник научных статьей - X-Международная научно-техническая и научно-методическая конференция "Актуальные проблемы инфотелекоммуникаций в науке и образовании". СПб. : СПбГУТ. Том 1. 2021. С. 411-416.
7. Коржик В.И., Небаева К.А., Алексеевс М. Использование модели канала с шумом для построения стегосистемы // Телекоммуникации, №7, 2013. С. 33-36.
8. Белозубова А.И., Когос К.Г., Лебедев Ф.В. Ограничение пропускной способности сетевых скрытых каналов по времени путем введения дополнительных случайных задержек перед отправкой пакета // Безопасность информационных технологий. № 4. Т. 28, 2021. С. 74-89.
9. Ahsan K., Kundur D. Practical Data Hiding in TCP/IP // Proceedings of the ACM Workshop on Multimedia Security. 2002, pp. 866 -870.
10. Cabuk S., Brodley C.E., Shields C. IP covert timing channels: design and detection // Proceedings of the eleventh ACM conference on computer and communications security. 2004, pр. 178-187.
11. Пшеничников А.П. Теория телетрафика: учебник для вузов. М.: Горячая линия - Телеком, 2017. 212 с.
12. Грушо А.А. О существовании скрытых каналов // Дискретная математика. Т.11. № 1. 1999. С. 24-28.
13. Lampson B.W. A Note on the Confinement Problem // Communications of the ACM, 1973, pp. 613-615.
14. Jonatha Anselmi, Neil Walton. Stability and Optimization of Speculative Queueing Networks. IEEE/ACM Transactions on Networking, IEEE/ACM, 2021, pp. 1-12.
Информация об авторах:
Ибрагимов Байрам Ганимат оглы, д.т.н., профессор Азербайджанского Технического Университета, Баку, Азербайджан Тахирова Конул Мамед кызы, Адъюнкт Национального Университета Обороны, Баку, Азербайджан
7ТТ
