An efficient hierarchical group key management protocol for a ubiquitous competing environment

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a new centralized hierarchical group key management protocol for a ubiquitous computing environment. The proposed scheme only uses XOR and hash operations during group key updates. Moreover, the order of the total message size sent during key updates is O(log n), where n is the size of the group. As a result, our scheme is very practical, scalable, and well suited for low-power mobile devices. We have also proved the security of our proposed protocol. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Kim, S., Ahn, T., & Oh, H. (2006). An efficient hierarchical group key management protocol for a ubiquitous competing environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3983 LNCS, pp. 388–395). Springer Verlag. https://doi.org/10.1007/11751632_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free