Research of the Secure Routing Method of Confidential Messages on Disjoint Paths

Abstract

The article proposes a secure routing method of confidential messages in a telecommunication network by disjoint paths and its research results. The presented method of disjoint paths secure routing of confidential messages is based on the sequential solution of two optimization problems: calculating disjoint routes and secure balancing of confidential message fragments on a set of precalculated paths. An optimization model was chosen to determine the set of routes, namely, to calculate the maximum number of disjoint paths, including communication links with minimum compromise probability. Additionally, a model of fragmented transmission using a precalculated set of disjoint paths was selected according to the SPREAD mechanism and Shamir’s scheme to ensure the minimum possible probability of message compromise. The study of the proposed secure routing method on the selected network configuration for three different variants of the link compromise probabilities has been conducted. The study results confirmed the effectiveness of the proposed secure routing method and the efficiency of the underlying optimization models to determine both the set of disjoint paths and the order of secure balancing of confidential message fragments. Prospects for further research in the field of secure routing in telecommunication networks are related to considering the link compromise probabilities and other essential indicators of network security.