Using bidirectional list structures to detect processing errors when encoding data in block chaining mode


Аuthors

Najajra M. 1*, Tanygin M. O.2**, Chesnokova A. A.2***

1. Al-Istiqlal University, Jericho, Palestine
2. South-Western State University, Kursk, Kursk, Russian Federation

*e-mail: mnajajra@pass.ps
**e-mail: tanygin@yandex.ru
***e-mail: chesnokova.50@yandex.ru

Abstract

The article examines the problem of detecting errors in identifying the source of messages in data authentication systems that use the cipher block chaining mode to reduce the volume of overhead data transmitted from UAVs. In this mode, the authentication tag of each message depends on the content of the previous one, forming a chain. Although this increases overall reliability, when the volume of transmitted information is reduced (and correspondingly the energy consumption of the UAV's radio transmitting module for broadcasting such data over the air is lowered), collisions of authentication tags between messages from the target and unintended sources can lead to ambiguities and errors in determining which message is authentic. Traditional methods that require buffering and subsequent analysis of the entire sequence of messages prove to be resource-intensive and create additional delays in the UAV control loop.
An approach is proposed based on the use of bidirectional list structures (graphs) for organizing the storage and processing of incoming messages in real time. In the proposed model, each message is represented as a vertex of the graph, and connections (edges) between vertices are established when the condition of matching authentication tags is met. The key idea of the method is the active detection of conflict situations (collisions) at the moment a new message is added to the graph, through the analysis of the formed connections. The algorithm identifies characteristic substructures (subgraphs of four vertices), the occurrence of which signals the impossibility of unambiguously identifying the source.
Mathematical modeling was conducted to assess the likelihood of the occurrence of such conflict structures and the associated additional computational costs. It was shown that if the condition linking the authentication tag length and the number of sources in the system is met, the probability of requiring additional analysis remains insignificant.

Keywords:

bidirectional list structures; coding; block coupling mode; energy efficiency; authentication

References

  1. Roy, K. S., Sujith, M., Bhanu, B., Preethi, & Hazarika, R. A. (2024). FPGA-based dual-layer authentication scheme utilizing AES and ECC for unmanned aerial vehicles. Eurasip Journal on Wireless Communications and Networking, 2024(1), Article 91. 
  2. IEEE P2510 – Standard for Establishing Quality of Data Sensor Parameters in the Internet of Things Environment, February 10, 2020
  3. Zhou, L., Li, X., Yeh, K., & Chiu, W. Lightweight IoT-based authentication scheme in cloud computing circumstance. Future Gener // Comput. Syst., 2019, 91, 244-251. 
  4. Abed, A., Abdelhafeez, A., & Fouad, M. Authentication in Cloud Computing Environments. Multicriteria Algorithms with Applications. 2024. 
  5. Arafin, T., & Qu, G. Hardware-Based Authentication Applications. 2021, 145-181. 
  6. Al-Shareeda, S. Data authentication algorithms. Authentication Technologies for Cloud Computing, IoT and Big Data. 2019
  7. IEEE Standard for Low-Rate Wireless Networks // IEEE Std 802.15.4-2020, pp.1-800, 23 July 2020, doi: 10.1109/IEEESTD.2020.9144691
  8. Petrov, D. ISM band wireless communication standards // Electronic components. - 2010. - No. 10. - pp. 28-32
  9. Perry L. Architecture of the Internet of Things. – Moscow: DMK Press, 2018. – 454 p. ISBN– 978-5-97060-672-8.
  10. Kireev, A. O., Svetlov, A.V. Distributed energy monitoring system for wireless sensor networks // Izvestiya SFU. Technical sciences. 2011. No. 5 (118). pp. 60-65.
  11. Galkin, P. V. Analysis of energy consumption of wireless sensor network nodes // ScienceRise. 2014. No. 2 (2). pp.55-61.
  12. Levchenko, P.; Bankov, D.; Khorov, E.; Lyakhov, A. Performance Comparison of NB-Fi, Sigfox, andLoRaWAN. Sensors 2022, 22, 9633.https://doi.org/10.3390/s22249633
  13. Unmanned aircraft systems. Part 3. Operational procedures [Electronic resource] // ISO 21384-3:2019 standard(E). URL: https://cdn.standards.iteh.ai/samples/70853/7ec34c8a22bf46958423b7e3a2e43693/ISO-21384-3-2019.pdf (accessed 08.11.2025).
  14. J. Zhao, D. Cheng, Ch. Hao An Improved Ant Colony Algorithm for Solving the Path Planning Problem of the Omnidirectional Mobile Vehicle // Mathematical Problems in Engineering. 2016 (12). doi: 10.1155/2016/7672839
  15. D. Shant P. Premkumar, «Block Level Data Integrity Assurance Using Matrix Dialing Method towards High Performance Data Security on Cloud Storage,» Scientific Research Publishing, т. 7, № 11, pp. 3626-3644, 2016
  16. Black, J. CBC MACs for arbitrary-length messages: The three-key constructions [Текст] / J. Black, P. Rogaway – J. Cryptol, 2015. – vol. 18 – №2 –                 P. 111–131
  17. Ben Othman, S., Alzaid, H., Trad, A., & Youssef, H.  An efficient secure data aggregation scheme for wireless sensor networks. // IISA 2013, doi:10.1109/iisa.2013.6623701
  18. M. Bellare, J. Kilian, P. Rogaway, “The security of the cipher block chaining message authentication code,” Journal of Computer and System Sciences, 2000, 61(3), pp. 362-399, DOI: 10.1006/jcss.1999.1694.
  19. W. Stallings “NIST block cipher modes of operation for authentication and combined confidentiality and authentication,”  Cryptologia, 2010, № 34, pp. 225- 235, doi: 10.1080/01611191003598295
  20. Tanygin M. O., Chesnokova A. A., Dobritsa V. P. Organization of storage of results of intermediate calculations in authentication tasks of message sources of limited length // Proceedings of MAI. – 2023. – № 133.
  21. Kolganov, A. S. Parallel implementation of the minimum spanning tree search algorithm using central and graphics processors / A. S. Kolganov // Bulletin of the South Ural State University. Series: Computational Mathematics and Computer Science. – 2016. – Vol. 5. – No. 3. – pp. 5-19. – DOI 10.14529/cmse160301
  22. Tasci, S., Demirbas, M Employing in-memory data grids for distributed graph processing // IEEE 2015 IEEE International Conference on Big Data (Big Data), 2015, pp. 1856–1864. doi:10.1109/bigdata.2015.7363959
  23. Paradies M, Lehner W, Bornhövd C GRAPHITE: an extensible graph traversal framework for relational database management systems. In: DBM. ACM, 2015pp 29:1–29:12. DOI : 10.1145/2791347.2791383
  24. Panagiotis Papadimitratos, Zygmunt J. Haas Secure message transmission in mobile ad hoc networks // Ad Hoc Networks – 2003 – №1 PP. 193–209
  25. Shi, X. A reversible watermarking authentication scheme for wireless sensor networks / X. Shi, D. Xiao // Information Sciences. – 2013 – Vol. 240 – P. 173-183. – DOI:10.1016/j.ins.2013.03.031
  26. Tanygin M. O., Alshaia H. Ya., Dobritsa V. P. Evaluation of the influence of buffer memory organization on the speed of execution of procedures for determining the source of messages // Proceedings of MAI, 2020, No. 114, http://mai.ru//upload/iblock/22f/Tanygin_Alshaia_Dobritsa_full.pdf .  DOI: 10.34759/trd-2020-114-155
  27. Plugatarev, A.V. A model for determining the source of messages based on statistical analysis of metadata in an open communication channel / A.V. Plugatarev // Caspian Journal: management and high technologies. – 2022. – № 4(60). – Pp. 30-37. – DOI 10.54398/20741707_2022_4_30. 
  28. A model of data placement in the internal memory of a computer implementing a data encoding scheme in the block coupling mode / M. O. Tanygin, A. A. A. Akhmad, O. V. Kazakova, D. Golubov // Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta. – 2023. – Vol. 27, No. 1. – pp. 73-91. – DOI 10.21869/2223-1560-2023-27-1-73-91.
  29. Tanygin, M. O. Theoretical foundations of identification of information sources transmitted by blocks of limited size / M. O. Tanygin. – Kursk : Closed Joint Stock Company "University Book", 2020. – 198 p. – ISBN 978-5-907311-85-5.

Download

mai.ru — informational site MAI

Copyright © 2000-2026 by MAI

 Вход