Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
The algorithm design manual
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Securing Ad Hoc Networks
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
Identity-based secure collaboration in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of denial of service attacks on ad hoc networks
IEEE/ACM Transactions on Networking (TON)
New directions in cryptography
IEEE Transactions on Information Theory
Editorial: Control and optimization over wireless networks
Journal of Network and Computer Applications
Building a reputation-based bootstrapping mechanism for newcomers in collaborative alert systems
Journal of Computer and System Sciences
Hi-index | 0.00 |
Wireless mobile ad hoc networks (MANETs) do not have centralized infrastructure and it is difficult to provide authentication services. In this paper, we apply Certificate Graph (CG) and identity-based security in designing an admission control scheme for MANETs. We first use one-hop message exchange to build CG at each mobile node. Then we select maximum clique nodes in CG as distributed Certificate Authorities (CAs). We use identity-based key agreement from pairings to protect each session. Then we prove the security by Canetti-Krawczyk (CK) model-based analysis. We demonstrate the effectiveness and feasibility of our protocol through computer simulations.