Expert key selection impact on the MANETs' performance using probabilistic key management algorithm

Gharib, Morteza; Minaei, Mohsen; Golkari, Morteza; Movaghar, Ali

doi:10.1145/2523514.2523556

Cited by 4 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In comparison, this number is in the order of the physical path length in symmetric key pre-distribution schemes. In contrast to the random key distribution, authors of [13] and [4] propose and analyze several more realistic scenarios for asymmetric key distribution.…”

Section: Symmetric Vs Asymmetric Key Pre-distributionmentioning

confidence: 99%

KPsec: Secure End-to-End Communications for Multi-Hop Wireless Networks

Gharib,

Owfi,

Ghorbani

2019

Preprint

Self Cite

View full text Add to dashboard Cite

The security of cyber-physical systems, from self-driving cars to medical devices, depends on their underlying multi-hop wireless networks. Yet, the lack of trusted central infrastructures and limited nodes' resources make securing these networks challenging. Recent works on key pre-distribution schemes, where nodes communicate over encrypted overlay paths, provide an appealing solution because of their distributed, computationally light-weight nature. Alas, these schemes share a glaring security vulnerability: the two ends of every overlay link can decryptand potentially modify and alter-the message. Plus, the longer overlay paths impose traffic overhead and increase latency. We present a novel routing mechanism, KPsec, to address these issues. KPsec deploys multiple disjoint paths and an initial key-exchange phase to secure end-to-end communications. After the initial key-exchange phase, traffic in KPsec follows the shortest paths and, in contrast to key predistribution schemes, intermediate nodes cannot decrypt it. We measure the security and performance of KPsec as well as three state-of-the-art key pre-distribution schemes using a real 10-node testbed and large-scale simulations. Our experiments show that, in addition to its security benefits, KPsec results in 5 − 15% improvement in network throughput, up to 75% reduction in latency, and an order of magnitude reduction in energy consumption.

show abstract

Section: Symmetric Vs Asymmetric Key Pre-distributionmentioning

confidence: 99%

KPsec: Secure End-to-End Communications for Multi-Hop Wireless Networks

Gharib,

Owfi,

Ghorbani

2019

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…key pre-distribution schemes choose the keys randomly [5], [4], [6] but there are several others that attempt at choosing keys in smarter ways [1], [2], [3], [7]. Since each node stores just a few keys, there may not be a direct secure path among some nodes.…”

mentioning

confidence: 99%

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

Gharib

Yousefi'zadeh

Movaghar

2016

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

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.

show abstract