Mobile agent based composite key management scheme for MANET

Pushpalakshmi, R.; Kumar, Amit; Rathore, Rahul

doi:10.1109/icetect.2011.5760259

Cited by 2 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Huang and Nicol [18] proved that the shortest certificate chain does not guarantee the most trustworthy path to obtain the public key of a target node due to different trustworthiness observed in each intermediate node on the certificate chain. In order for public keys and their certificates to be managed by trustworthy CAs in the hierarchical public key management structure, Xu et al [24] and PushpaLakshimi et al [22] used cluster heads as trustworthy CAs based on their trust in the system. However, these works [24,22] still reveal a single point of failure and did not show specific trust models and attacks considered.…”

Section: Dahshan and Irvinmentioning

confidence: 99%

“…In order for public keys and their certificates to be managed by trustworthy CAs in the hierarchical public key management structure, Xu et al [24] and PushpaLakshimi et al [22] used cluster heads as trustworthy CAs based on their trust in the system. However, these works [24,22] still reveal a single point of failure and did not show specific trust models and attacks considered. Wu et al [19] proposed a key management protocol for MAENTs for efficiency in updating certificates and security in key revocation.…”

Section: Dahshan and Irvinmentioning

confidence: 99%

“…Many studies used certificate-based public key management. However, they have brought out practical limitations including high communication overhead or delay [15,21], and using static trust [20,24,22,23] to select CAs. In addition, hierarchy-based selection of CAs (e.g., group leaders or cluster heads) [16,17,18,19] also reveals high security vulnerabilities when the selected CAs are compromised.…”

Section: Dahshan and Irvinmentioning

confidence: 99%

“…Our work differs from the above works in that we devise a trust metric considering multiple dimensions of a node's trust and leverage it for decision making in the process of key management and group communication in order to achieve system goals including high service availability, low communication cost, and low risk. Existing certificate-based public key management schemes cited above expose practical limitations, including needing a centralized trusted CA [25], high communication overhead or delay [15,21], and using static trust [20,24,22,23] to select CAs. In addition, hierarchy-based selection of CAs (e.g., group leaders or cluster heads) [16,17,18,19] can lead to high security vulnerability when the selected CAs are attacked and compromised.…”

Section: Dahshan and Irvinmentioning

confidence: 99%

“…2. Relative to existing trust-based distributed key management algorithms for MANETs without using a centralized trusted CA [20,21,22,23,24], our contribution is to develop a threshold-based filtering mechanism that can effectively exploit the inherent tradeoff between trust and risk. The end result is that CTPKM is able to identify the optimal trust threshold to be applied at runtime for differentiating trustworthy vs. untrustworthy nodes to maximize key management service availability.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Trust threshold based public key management in mobile ad hoc networks

2016

View full text Add to dashboard Cite

Public key management in mobile ad hoc networks (MANETs) has been studied for several decades. However, the unique characteristics of MANETs have imposed great challenges in designing a fully distributed public key management protocol under resource-constrained MANET environments. These challenges include no centralized trusted entities, resource constraints, and high security vulnerabilities. This work proposes a fully distributed trust-based public key management approach for MANETs using a soft security mechanism based on the concept of trust. Instead of using hard security approaches, as in traditional security techniques, to eliminate security vulnerabilities, our work aims to maximize performance by relaxing security requirements based on the perceived trust. We propose a composite trust-based public key management (CTPKM) with the goal of maximizing performance while mitigating security vulnerability. Each node employs a trust threshold to determine whether or not to trust another node. Our simulation results show that an optimal trust threshold exists to best balance and meet the conflicting goals between performance and security, by exploiting the inherent tradeoff between trust and risk. The results also show that CTPKM minimizes risk (i.e., information leakout) using an optimal trust threshold while maximizing service availability with acceptable communication overhead incurred by trust and key management operations. We demonstrate that CTPKM outperforms both existing non-trust-based and trust-based counterparts.

show abstract