Secure Transferring Routing Using Primary Pre Share an Optimization Advance for Remote Optimization (original) (raw)

Secure Overlay Routing Using Key Pre-Distribution: A Linear Distance Optimization Approach

IEEE Transactions on Mobile Computing, 2016

Key pre-distribution algorithms have recently emerged as efficient alternatives of key management in today's secure communications landscape. Secure routing techniques using key pre-distribution algorithms require special algorithms capable of finding optimal secure overlay paths. To the best of our knowledge, the literature of key pre-distribution systems is still facing a major void in proposing optimal overlay routing algorithms. In the literature work, traditional routing algorithms are typically used twice to find a NETWORK layer path from the source node to the destination and then to find required cryptographic paths. In this paper, we model the problem of secure routing using weighted directed graphs and propose a boolean linear programming (LP) problem to find the optimal path. Albeit the fact that the solutions to boolean LP problems are of much higher complexities, we propose a method for solving our problem in polynomial time. In order to evaluate its performance and security measures, we apply our proposed algorithm to a number of recently proposed symmetric and asymmetric key pre-distribution methods. The results show that our proposed algorithm offers great network performance improvements as well as security enhancements when augmenting baseline techniques.

Enhanced Overlay routing With Efficient Key Distribution in Network

2017

We demonstrate the issue of secure routing utilizing weighted coordinated graphs and propose a boolean linear programming (LP) issue to locate the ideal way. Though the way that the answers for boolean LP issues are of considerably higher complexities, we propose a technique for tackling our issue in polynomial time. So as to assess its execution and safety efforts, we apply our proposed calculation to various as of late proposed symmetric and unbalanced key pre-dissemination strategies. The outcomes demonstrate that our proposed algorithm offers extraordinary system execution changes and in addition security upgrades while augmenting benchmark procedures.

1Secure Overlay Routing Using Key Pre-Distribution: A Linear Distance Optimization Approach

2016

Abstract—Key pre-distribution algorithms have recently emerged as efficient alternatives of key management in today’s secure communications landscape. Secure routing techniques using key pre-distribution algorithms require special algorithms capable of finding optimal secure overlay paths. To the best of our knowledge, the literature of key pre-distribution systems is still facing a major void in proposing optimal overlay routing algorithms. In the literature work, traditional routing algorithms are typically used twice to find a NETWORK layer path from the source node to the destination and then to find required cryptographic paths. In this paper, we model the problem of secure routing using weighted directed graphs and propose a boolean linear programming (LP) problem to find the optimal path. Albeit the fact that the solutions to boolean LP problems are of much higher complexities, we propose a method for solving our problem in polynomial time. In order to evaluate its performanc...

Secure Overlay Routing for Large Scale Networks

IEEE Transactions on Network Science and Engineering, 2019

Probabilistic key pre-distribution schemes have recently emerged as major tools of addressing secure routing challenge in wireless networks. In our previous work, we propose an algorithm capable of finding optimal secure paths in overlay wireless networks. An important concern related to that algorithm is the scalability of the solution for large scale networks containing thousands of nodes. In this paper, we propose two alternative solutions for the previously formulated problem of secure overlay routing that can effectively scale to thousands of nodes. The first one is a deterministic Dijkstra-based algorithm analytically proven to find the optimal path with a time complexity much lower than that of the original algorithm. The second alternative is an approximation method capable of finding a near optimal path with an accuracy of 99% compared to the optimal path. At the cost of a space complexity in the order O(n log 3 n), this algorithm can find the near optimal path with a linear time complexity compared to quadratic or multiplicative time complexity associated with the first algorithm proposed in this paper. Experimental results using a number of different key pre-distribution schemes confirm our analytical findings.

Route Computation for Reliable Delivery of Threshold Secret Shared Content

IEICE Transactions on Communications, 2015

A threshold secret sharing scheme can protect content by dividing it into many pieces and distributing them over different servers. This scheme can also be utilized for reliable delivery of the content. Thanks to this scheme, the receiver can still reconstruct the original content even if several pieces are lost on their delivery routes due to the occurrence of a multiple-link failure. This paper aims to obtain reliable delivery routes for the pieces, as this will minimize the probability that the receiver cannot reconstruct the original content. Although such a route optimization problem can be formulated using an ILP (Integer Linear Programming) model, optimum route computation based on the ILP model requires large amounts of computational resources. Thus, this paper proposes a lightweight method for computing suboptimum delivery routes. The proposed greedy method computes each of the delivery routes successively by using the conventional shortest route algorithm repeatedly. The distance of the links is adjusted iteratively on the basis of the given probability of failure on each link and utilized for the calculation of each shortest route. The results of a performance evaluation show that the proposed method based on the strict adjustment of the link distance can compute sufficiently optimum delivery routes at less than 100 seconds, even in backbone networks of a practical scale. Keywords -reliable content delivery; threshold secret sharing; route optimization; greedy method; adjustment of link distance 978-1-4799-4009-7/14/$31.00 ©2014 IEEE

Constructing Disjoint Paths for Secure Communication

Lecture Notes in Computer Science, 2003

We propose a bandwidth-efficient algorithmic solution for perfectly-secure communication in the absence of secure infrastructure. Our solution involves connecting vertex pairs by a set of k edge-disjoint paths (a structure we call a k-system) where k is a parameter determined by the connectivity of the network. This structure is resilient to adversaries with bounded eavesdropping capability. To ensure that bandwidth is efficiently used we consider connection requests as inputs to the k-Edge Disjoint Path Coloring Problem (k-EDPCOL), a generalization of the Path Coloring Problem, in which each vertex pair is connected by a k-system, and each k-system is assigned a color such that two overlapping k-systems do not have the same color. The objective is to minimize the number of colors. We give a distributed and competitive online algorithm for k-EDPCOL. Additionally, since security applications are our focus we prove that a malicious adversary which attacks the algorithm during the process of construction of a k-system cannot learn anything more than if it had attacked the k-system once it was built.

Route Computation Method for Secure Delivery of Secret Shared Content

IEICE Transactions on Communications, 2012

Secret sharing schemes have been proposed to protect content by dividing it into many pieces securely and distributing them over different locations. Secret sharing schemes can also be used for the secure delivery of content. The original content cannot be reconstructed by the attacker if the attacker cannot eavesdrop on all the pieces delivered from multiple content servers. This paper aims to obtain secure delivery routes for the pieces, which minimizes the probability that all the pieces can be stolen on the links composing the delivery routes. Although such a route optimization problem can be formulated using an ILP (Integer Linear Programming) model, optimum route computation based on the ILP model requires large amounts of computational resources. Thus, this paper proposes a lightweight route computation method for obtaining suboptimum delivery routes that achieve a sufficiently small probability of all the pieces being stolen. The proposed method computes the delivery routes successively by using the conventional shortest route algorithm repeatedly. The distance of the links accommodating the routes that have already been calculated is adjusted iteratively and utilized for calculation of the new shortest route. The results of a performance evaluation clarify that sufficiently optimum routes can be computed instantly even in practical large-scale networks by the proposed method, which adjusts the link distance strictly based on the risk level at the considered link. key words: route computation method, secure content delivery, secret sharing scheme, shortest route algorithm, link distance adjustment

Hypercube and Cascading-based Algorithms for Secret Sharing Schemes

IACR Cryptol. ePrint Arch., 2020

Secret sharing is a very useful way to maintain secrecy of private data when stored in a distributed way among several nodes. Two significant questions in this area are 1. how to accommodate new nodes and assign shares to the new nodes, the problem becomes harder if the number of joining nodes or the access structure is not known in advance and can be (potentially) unbounded and 2. to reduce the computational complexity of secret sharing schemes. In this paper we propose two new constructions of such secret sharing schemes based on different combinatorial structures. The first construction is based on generalized paths joining the opposite vertices of a hypercube which has been divided into smaller hypercubes. The second construction is a forestbased construction utilizing a dynamic data structure technique known as fractional cascading. The generalized path we call a pavement is new to this paper. Both our constructions use a new secret redistribution scheme to assign and re-assign...

Secure Transmission To Remote Cooperative Groups With Minimized Communication Overhead

In Wireless Mesh networks there is a need to Multicast to a remote cooperative group using encrypted transmission. The existing paradigms failed to provide better efficiency and security in these kind of transmissions. A major challenge in devising such a system involves in achieving efficient usage of Bandwidth and Reducing the number of unintended receivers. In this paper we circumvent these obstacles and close this gap by involving a sender based algorithm .This new paradigm is a hybrid of traditional Multicasting, shortest path techniques and group key management. In such a system, for every source destination pair the protocol adaptively calculates the mean delays along all the utilized paths and avoid the paths with greater or equal mean delays. Which eventually reduces the usage of unwanted paths and also results in reducing the number of unintended receivers at a considerable rate. This approach efficiently deals with the computation overhead and usage of network resources. Further more our scheme provides better security by reducing the number of unintended receivers..

Multi-path Routing Scheme for Preserving Privacy in Wireless Mesh Networks

Enhancing security for routing in Multi-hop Wireless Mesh Networks currently becomes challenging topic because of inherent vulnerabilities of wireless communications. To utilize the characteristics of WMN's topology, in this paper, we propose an algorithm to preserve privacy for routing. This idea comes from the fact that if we can separate data traffic into more than one path, the probability to capture all traffic from intermediate node is very small. It means it is very difficult to launch traffic analysis attacks because of traffic confidentiality. In addition, a new technique to securely hide the real source and destination addresses is proposed along with an Adaptive Key Agreement Scheme. We apply Information Entropy to model our routing traffic and highlight the robustness of the algorithm. We also present a detail traffic evaluation observed from neighboring nodes to show the availability of our proposal in term of loop free and computational overhead.