GROUP STATE ROUTING PROTOCOL (MYCELIA): НОВА МОДЕЛЬ КООРДИНАЦІЇ РО-ЗПОДІЛЕНОЇ МЕРЕЖІ
DOI:
https://doi.org/10.18372/2310-5461.68.20240Keywords:
secure communication channels, network protocols, encryption, security incidents, distributed systems, decentralized systems, distributed network coordination, traffic meshing with RSDPAbstract
The following article is describing a new model of managing secure communication channels in a distributed environment with the aim of minimizing cryptographic windows and attack vectors based on traffic correlation analysis. In the contemporary world of digital interconnection, having the ability to preserve the confidentiality of the data exchange between multiple peers gains significant importance. A secure communication channel must provide meaningful guarantees of confidentiality, integrity, and availability of the data that is being transmitted as well as ensure minimized latencies due to security mechanism overhead.
Existing solutions centered around Virtual Private Networks, mesh-like topologies, and relays share limitations in their ability to avoid traffic concentration points such as entry and public-facing nodes. Thus, it is possible for cryptanalysts to correlate traffic in some cases and potentially compromise the secrecy of communication. Hence, the proposed model aims to avoid such concentration points during traffic transmission by leveraging the capabilities of group routing and decentralized cluster state coordination based on the Replica State Discovery Protocol.
A comparative analysis has been conducted to illustrate the difference in communication topologies between existing solutions and the proposed protocol. At the basis of this research is a theoretical analysis of the proposed model’s topology and methods used to facilitate the secure channels’ creation and traffic relay mechanisms. Mathematical modeling has been leveraged to formally describe the properties of the proposed protocol to further facilitate its integration into the modern communication systems.
As a result, a model for a distributed management of secure communication channels has been developed and analyzed that reduces the likelihood of attacks based on traffic correlation and thus improves the confidentiality characteristics of the connection between participating peers. A new path routing method based on relay groups has been proposed as well as the traffic dispersion principles related to the outgoing traffic from the mesh network. Secondly, a method of distributed traffic dispersion and coordination has been developed based on the RSDP that allows for avoiding concentration of authority and thus lays the foundation for the decentralized version of building secure communication channels
References
Barrett-danes F., Ahmad F. Quantum computing and cybersecurity: a rigorous systematic review of emerging threats, post-quantum solutions, and research directions (2019–2024). Discover Applied Sciences. 2025. Vol. 7, No. 10. P. 1083. DOI: 10.1007/s42452-025-07322-5.
Bhutta M.N.M., Khwaja A.A., Nadeem A., Ahmad H.F., Khan M.K., Hanif M.A., Song H., Alshamari M., Cao Y. A Survey on Blockchain Technology: Evolution, Architecture and Security. IEEE Access. 2021. Vol. 9. P. 61048–61073. DOI: 10.1109/ACCESS.2021.3072849.
Alghamdi T.A., Khalid R., Javaid N. A Survey of Blockchain Based Systems: Scalability Issues and Solutions, Applications and Future Challenges. IEEE Access. 2024. Vol. 12. P. 79626–79651. DOI: 10.1109/ACCESS.2024.3408868.
Qollakaj K., Larsson L.E., Memeti S. Cybersecurity of remote work migration: A study on the VPN security landscape post Covid-19 outbreak. Array. 2025. Vol. 27. P. 100437. DOI: 10.1016/j.array.2025.100437.
Sudipti Banerjee., Dr. Rajni Ranjan Singh Makwana. Virtual Private Network: Survey and Research Challenges. International Journal of Latest Technology in Engineering Management & Applied Science. 2025. Vol. 14, No. 6. P. 211–226. DOI: 10.51583/IJLTEMAS.2025.140600028.
Alsabah M., Goldberg I. Performance and Security Improvements for Tor: A Survey. ACM Computing Surveys. 2017. Vol. 49, No. 2. P. 1–36. DOI: 10.1145/2946802.
Karunanayake I., Ahmed N., Malaney R., Islam R., Jha S.K. De-Anonymisation Attacks on Tor: A Survey. IEEE Communications Surveys & Tutorials. 2021. Vol. 23, No. 4. P. 2324–2350. DOI: 10.1109/COMST.2021.3093615.
Cui J., Huang C., Meng H., Wei R. Tor network anonymity evaluation based on node anonymity. Cybersecurity. 2023. Vol. 6, No. 1. P. 55. DOI: 10.1186/s42400-023-00191-8.
Reed M.G., Syverson P.F., Goldschlag D.M. Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communications. 1998. Vol. 16, No. 4. P. 482–494. DOI: 10.1109/49.668972.
S. M., Thangavel G., Basheer S. A Review on Garlic Routing and Artificial Intelligence Applications in Public Network. 2023 International Conference on Computer Science and Emerging Technologies (CSET): 2023 International Conference on Computer Science and Emerging Technologies (CSET). Bangalore, India: IEEE, 2023. P. 1–6. DOI: 10.1109/CSET58993.2023.10346642.
Jadav N.K., Gupta R., Tanwar S. Garlic Routing-Based Privacy Preserving Framework for Secure Data Exchange Between IoMVs with 5G. 2023 International Conference on Network, Multimedia and Information Technology (NMITCON): 2023 International Conference on Network, Multimedia and Information Technology (NMITCON). Bengaluru, India: IEEE, 2023. P. 1–6. DOI: 10.1109/NMITCON58196.2023.10276185.
Kjorveziroski V., Bernad C., Gilly K., Filiposka S. Full‐mesh VPN performance evaluation for a secure edge‐cloud continuum. Software: Practice and Experience. 2024. Vol. 54, No. 8. P. 1543–1564. DOI: 10.1002/spe.3329.
Subratie K., Aditya S., Figueiredo R.J. EdgeVPN: Self-organizing layer-2 virtual edge networks. Future Generation Computer Systems. 2023. Vol. 140. P. 104–116. DOI: 10.1016/j.future.2022.10.007.
Sun X., Yu F.R., Zhang P., Sun Z., Xie W., Peng X. A Survey on Zero-Knowledge Proof in Blockchain. IEEE Network. 2021. Vol. 35, No. 4. P. 198–205. DOI: 10.1109/MNET.011.2000473.
Capko D., Vukmirovic S., Nedic N. State of the Art of Zero-Knowledge Proofs in Blockchain. 2022 30th Telecommunications Forum (TELFOR): 2022 30th Telecommunications Forum (TELFOR). Belgrade, Serbia: IEEE, 2022. P. 1–4. DOI: 10.1109/TELFOR56187.2022.9983760.
Halpin H. Nym Credentials: Privacy-Preserving Decentralized Identity with Blockchains. 2020 Crypto Valley Conference on Blockchain Technology (CVCBT): 2020 Crypto Valley Conference on Blockchain Technology (CVCBT). Rotkreuz, Switzerland: IEEE, 2020. P. 56–67. DOI: 10.1109/CVCBT50464.2020.00010.
Danezis G., Goldberg I. Sphinx: A Compact and Provably Secure Mix Format. 2009 30th IEEE Symposium on Security and Privacy (SP): 2009 30th IEEE Symposium on Security and Privacy. Oakland, CA, USA: IEEE, 2009. P. 269–282. DOI: 10.1109/SP.2009.15.
Halpin H. Simulation of Mixmining Reward Parameters for the Nym Mixnet. Ubiquitous Security. / ed. by Wang G., Wang H., Min G., Georgalas N., Meng W. Singapore: Springer Nature Singapore, 2024. Vol. 2034. P. 363–379. (Communications in Computer and Information Science). DOI: 10.1007/978-981-97-1274-8_24.
Alwen J., Blanchet B., Hauck E., Kiltz E., Lipp B., Riepel D. Analysing the HPKE Standard. Advances in Cryptology – EUROCRYPT 2021. / ed. by Canteaut A., Standaert F.-X. Cham: Springer International Publishing, 2021. Vol. 12696. P. 87–116. (Lecture Notes in Computer Science). DOI: 10.1007/978-3-030-77870-5_4.
Kotov M., Toliupa S. Layered Architecture for RSDP V3.0: Modular Distributed Consensus and Coordination. Networks and Sustainability. / ed. by Luntovskyy A., Klymash M., Melnyk I., Beshley M., Gütter D. Cham: Springer Nature Switzerland, 2025. Vol. 1473. P. 140–160. (Lecture Notes in Electrical Engineering). DOI: 10.1007/978-3-032-02272-1_6.
Toliupa S., Kotov M., Buchyk S., Boiko J., Shtanenko S. Stateful Cluster Leader Failover Models and Methods Based on Replica State Discovery Protocol. Information Technology and Implementation Workshop (IT&I-WS 2024: Intelligent Systems and Security): Proceedings of the Information Technology and Implementation (IT&I) Workshop: Intelligent Systems and Security (IT&I-WS 2024: ISS), Kyiv, Ukraine, November 20 – 21, 2024. CEUR-WS.org, 2024. Vol. 3933. P. 120–140. URL: https://ceur-ws.org/Vol-3933/Paper_10.pdf.
Kotov M., Toliupa S., Nakonechnyi V., Buchyk S., Buchyk O. Byzantine Fault Tolerance in Distributed Systems: Advancing the Replica State Discovery Protocol v2. 0. CEUR-WS.org, 2025. Vol. 3991. P. 121–138. URL: https://ceur-ws.org/Vol-3991/paper10.pdf.
Kaplan D. An overview of Markov chain methods for the study of stage-sequential developmental processes. Developmental Psychology. 2008. Vol. 44, No. 2. P. 457–467. DOI: 10.1037/0012-1649.44.2.457.
Imani M., Amirabadi M., Wright M. Modified relay selection and circuit selection for faster Tor. IET Communications. 2019. Vol. 13, No. 17. P. 2723–2734. DOI: 10.1049/iet-com.2018.5591.
Ali A., Khan M., Saddique M., Pirzada U., Zohaib M., Ahmad I., Debnath N. TOR vs I2P: A Comparative Study. 2016 IEEE International Conference on Industrial Technology (ICIT): 2016 IEEE International Conference on Industrial Technology (ICIT). Taipei, Taiwan: IEEE, 2016. P. 1748–1751. DOI: 10.1109/ICIT.2016.7475027.
Halpin H. Nym Credentials: Privacy-Preserving Decentralized Identity with Blockchains. 2020 Crypto Valley Conference on Blockchain Technology (CVCBT): 2020 Crypto Valley Conference on Blockchain Technology (CVCBT). Rotkreuz, Switzerland: IEEE, 2020. P. 56–67. DOI: 10.1109/CVCBT50464.2020.00010.
Janson S. Large Deviation Inequalities for Sums of Indicator Variables. arXiv.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.
