Authentication and authenticated key exchanges
Designs, Codes and Cryptography
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Establishing trust in pure ad-hoc networks
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Group Key Agreement Efficient in Communication
IEEE Transactions on Computers
A Dynamic Trust Model for Mobile Ad Hoc Networks
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
Stochastic properties of the random waypoint mobility model
Wireless Networks
An Efficient Group Key Agreement Protocol for Ad Hoc Networks
WOWMOM '05 Proceedings of the First International IEEE WoWMoM Workshop on Trust, Security and Privacy for Ubiquitous Computing - Volume 03
Modeling insider attacks on group key-exchange protocols
Proceedings of the 12th ACM conference on Computer and communications security
A Mobility-Resistant Efficient Clustering Approach for ad hoc and sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
A three round authenticated group key agreement protocol for ad hoc networks
Pervasive and Mobile Computing
Tree-based group key agreement framework for mobile ad-hoc networks
Future Generation Computer Systems
Performance optimization of region-based group key management in mobile ad hoc networks
Performance Evaluation
A scalable key management and clustering scheme for wireless ad hoc and sensor networks
Future Generation Computer Systems
Distributed key management for dynamic groups in MANETs
Pervasive and Mobile Computing
New directions in cryptography
IEEE Transactions on Information Theory
On trust models and trust evaluation metrics for ad hoc networks
IEEE Journal on Selected Areas in Communications
Secure Minimum-Energy Multicast Tree Based on Trust Mechanism for Cognitive Radio Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.24 |
Mobile Ad hoc NETworks (or MANETs) are flexible networks that are expected to support emerging group applications such as spontaneous collaborative activities and rescue operations. In order to provide secrecy to these applications, a common encryption key has to be established between group members of the application. This task is critical in MANETs because these networks have no fixed infrastructure, frequent node and link failures and a dynamic topology. The proposed approaches to cope with these characteristics aim to avoid centralized solutions and organize the network into clusters. However, the clustering criteria used in the literature are not always adequate for key management and security. In, this paper, we propose, a group key management framework based on a trust oriented clustering scheme. We show that trust is a relevant clustering criterion for group key management in MANETs. Trust information enforce authentication and is disseminated by the mobility of nodes. Furthermore, it helps to evict malicious nodes from the multicast session even if they are authorized members of the group. Simulation results show that our solution is efficient and typically adapted to mobility of nodes.