Providing cyber resilience in software-defined networks by secure routing means

Chhaytli, A.; Persikov, Mykhailo

doi:10.23939/ictee2021.01.011

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Як показано у роботах [2,[5][6][7][8][9]] за допомогою засобів маршрутизації може здійснюватися безпечна доставка різної конфіденційної інформації, зокрема сеансових ключів, інформації про аутентифікацію, критично важливих даних користувачів тощо. Таким чином, методи безпечної маршрутизації є одними з ключових механізмів забезпечення інформаційної безпеки на рівні інфраструктури та безпосередньо впливають на показники захищеності та кіберстійкості інфокомунікаційних мереж (ІКМ) [10][11][12][13][14].…”

unclassified

Methodology for Calculating the Confidential Messages Compromise Probability during Secure Routing in Infocommunication Networks using Intersecting Paths

Lemeshko¹,

Yeremenko²,

Yevdokymenko³

et al. 2021

ПТ

View full text Add to dashboard Cite

The work presents and investigates the method of calculating the probability of confidential message compromise during secure routing in infocommunication networks, fragments of which are transmitted by intersecting paths. In comparison with existing approaches, in particular with the well-known SPREAD method, which allows the routing of confidential message fragments only by disjoint paths, the proposed solution makes it possible to achieve more efficient usage of network and cyber resources when solving the secure routing problem. The methodology is based on a mathematical model for calculating the compromise probability of fragmented messages. It was improved to enable its application in networks with a more complex structure, where routing paths are represented not only by the series-parallel connection of links but also bridges may be present. The effectiveness of the presented solution regarding secure routing was evaluated by the indicator of the confidential message compromise probability using the mechanism of its fragmentation according to Shamir’s scheme. At the same time, unlike the well-known SPREAD approach, the presented technique does not require the preliminary calculation of the paths through which message fragments are transmitted, simplifying its implementation in practice. The analysis of the proposed method confirmed its higher efficiency compared to the SPREAD method, while the lower the values of the network link compromise probability, the greater the gain in terms of the message compromise probability, even in a small network with a small number of nodes, links, and only one bridge. The proposed technique is implemented as software prototypes of secure routing protocols in MATLAB and Python environments.

show abstract

unclassified