Secure and Efficient Group Key Agreements for Cluster Based Networks
Transactions on Computational Science IV
Universally composable contributory group key exchange
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Group device pairing based secure sensor association and key management for body area networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Comments on "provably secure constant round contributory group key agreement in dynamic setting"
IEEE Transactions on Information Theory
Dynamic asymmetric group key agreement for ad hoc networks
Ad Hoc Networks
Modeling key compromise impersonation attacks on group key exchange protocols
ACM Transactions on Information and System Security (TISSEC)
Information Sciences: an International Journal
Group key agreement for secure group communication in dynamic peer systems
Journal of Parallel and Distributed Computing
KALwEN: a new practical and interoperable key management scheme for body sensor networks
Security and Communication Networks
Secure ad hoc trust initialization and key management in wireless body area networks
ACM Transactions on Sensor Networks (TOSN)
Towards formal analysis of key control in group key agreement protocols
SPACE'12 Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography Engineering
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Fast transmission to remote cooperative groups: a new key management paradigm
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.90 |
In this paper, we present and analyze a variant of Burmester-Desmedt group key agreement protocol (BD) and enhance it to dynamic setting where a set of users can leave or join the group at any time during protocol execution with updated keys. In contrast to BD protocol, let us refer to our protocol as DB protocol. Although the DB protocol is similar to BD protocol, there are subtle differences between them: 1) Key computation in DB protocol is different and simpler than in BD protocol with same complexity of BD protocol; 2) Number of rounds required in our authenticated DB protocol is one less than that in authenticated BD protocol introduced by Katz-Yung; 3) DB protocol is more flexible than BD protocol in the sense that DB protocol is dynamic. The reusability of user's precomputed data in previous session enables the join and leave algorithms of our DB protocol to reduce most user's computation complexities which can be useful in real life applications; and 4) DB protocol has the ability to detect the presence of corrupted group members, although one can not detect who among the group members are behaving improperly.