M. Bilal, and S. Kang. Cluster Computing, 20 (3):
2779–2792(2017)cite arxiv:1704.02683Comment: This article is accepted for the publication in Cluster Computing-The Journal of Networks, Software Tools and Applications. Print ISSN 1386-7857, Online ISSN 1573-7543.
DOI: 10.1007/s10586-017-0853-0
Abstract
To accomplish secure group communication, it is essential to share a unique
cryptographic key among group members. The underlying challenges to group key
agreement are scalability, efficiency, and security. In a dynamic group
environment, the rekeying process is more frequent; therefore, it is more
crucial to design an efficient group key agreement protocol. Moreover, with the
emergence of various group-based services, it is becoming common for several
multicast groups to coexist in the same network. These multicast groups may
have several shared users; a join or leave request by a single user can trigger
regeneration of multiple group keys. Under the given circumstances the rekeying
process becomes a challenging task. In this work, we propose a novel
methodology for group key agreement which exploits the state vectors of group
members. The state vector is a set of randomly generated nonce instances which
determine the logical link between group members and which empowers the group
member to generate multiple cryptographic keys independently. Using local
knowledge of a secret nonce, each member can generate and share a large number
of secure keys, indicating that SGRS inherently provides a considerable amount
of secure subgroup multicast communication using subgroup multicasting keys
derived from local state vectors. The resulting protocol is secure and
efficient in terms of both communication and computation.
cite arxiv:1704.02683Comment: This article is accepted for the publication in Cluster Computing-The Journal of Networks, Software Tools and Applications. Print ISSN 1386-7857, Online ISSN 1573-7543
%0 Journal Article
%1 bilal2017secure
%A Bilal, Muhammad
%A Kang, Shin-Gak
%D 2017
%J Cluster Computing
%K Confidentiality Dynamic Group Key Multicast Resource agreement distribution key myown security sharing system
%N 3
%P 2779–2792
%R 10.1007/s10586-017-0853-0
%T A Secure Key Agreement Protocol for Dynamic Group
%U http://arxiv.org/abs/1704.02683
%V 20
%X To accomplish secure group communication, it is essential to share a unique
cryptographic key among group members. The underlying challenges to group key
agreement are scalability, efficiency, and security. In a dynamic group
environment, the rekeying process is more frequent; therefore, it is more
crucial to design an efficient group key agreement protocol. Moreover, with the
emergence of various group-based services, it is becoming common for several
multicast groups to coexist in the same network. These multicast groups may
have several shared users; a join or leave request by a single user can trigger
regeneration of multiple group keys. Under the given circumstances the rekeying
process becomes a challenging task. In this work, we propose a novel
methodology for group key agreement which exploits the state vectors of group
members. The state vector is a set of randomly generated nonce instances which
determine the logical link between group members and which empowers the group
member to generate multiple cryptographic keys independently. Using local
knowledge of a secret nonce, each member can generate and share a large number
of secure keys, indicating that SGRS inherently provides a considerable amount
of secure subgroup multicast communication using subgroup multicasting keys
derived from local state vectors. The resulting protocol is secure and
efficient in terms of both communication and computation.
@article{bilal2017secure,
abstract = {To accomplish secure group communication, it is essential to share a unique
cryptographic key among group members. The underlying challenges to group key
agreement are scalability, efficiency, and security. In a dynamic group
environment, the rekeying process is more frequent; therefore, it is more
crucial to design an efficient group key agreement protocol. Moreover, with the
emergence of various group-based services, it is becoming common for several
multicast groups to coexist in the same network. These multicast groups may
have several shared users; a join or leave request by a single user can trigger
regeneration of multiple group keys. Under the given circumstances the rekeying
process becomes a challenging task. In this work, we propose a novel
methodology for group key agreement which exploits the state vectors of group
members. The state vector is a set of randomly generated nonce instances which
determine the logical link between group members and which empowers the group
member to generate multiple cryptographic keys independently. Using local
knowledge of a secret nonce, each member can generate and share a large number
of secure keys, indicating that SGRS inherently provides a considerable amount
of secure subgroup multicast communication using subgroup multicasting keys
derived from local state vectors. The resulting protocol is secure and
efficient in terms of both communication and computation.},
added-at = {2018-09-18T07:01:09.000+0200},
author = {Bilal, Muhammad and Kang, Shin-Gak},
biburl = {https://www.bibsonomy.org/bibtex/2bb6a04f4d952aac4686bcdc5d5dd270d/mbilal084},
description = {A Secure Key Agreement Protocol for Dynamic Group},
doi = {10.1007/s10586-017-0853-0},
interhash = {353e04a2154d23a016aaac7f44e6b20a},
intrahash = {bb6a04f4d952aac4686bcdc5d5dd270d},
issn = {1386-7857},
journal = {Cluster Computing},
keywords = {Confidentiality Dynamic Group Key Multicast Resource agreement distribution key myown security sharing system},
note = {cite arxiv:1704.02683Comment: This article is accepted for the publication in Cluster Computing-The Journal of Networks, Software Tools and Applications. Print ISSN 1386-7857, Online ISSN 1573-7543},
number = 3,
pages = {2779–2792},
timestamp = {2018-09-18T07:01:09.000+0200},
title = {A Secure Key Agreement Protocol for Dynamic Group},
url = {http://arxiv.org/abs/1704.02683},
volume = 20,
year = 2017
}