Efficient key agreement for merging clusters in ad-hoc networking environments

Authors:
Sooyeon Shin;Taekyoung Kwon
Affiliations:
Information Security and Computer Networks Lab., Sejong University, Seoul, Korea;Information Security and Computer Networks Lab., Sejong University, Seoul, Korea
Venue:
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Year:
2005

Citing 5
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ariadne: a secure on-demand routing protocol for ad hoc networks

Proceedings of the 8th annual international conference on Mobile computing and networking
The Group Diffie-Hellman Problems

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Authenticated key exchange secure against dictionary attacks

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a simple scheme that can effectively deal with merging different adjacent clusters in ad-hoc networks. When nodes of each cluster have already agreed on their own group keys and intend to merge themselves for further secure communications, our scheme can be used in an efficient and secure way.