%0 Generic %1 bilal2017secure %A Bilal, Muhammad %A Kang, Shin-Gak %D 2017 %K Group confidentiality dynamic key multicast rekeying resource scalability security sharing system %R 10.1007/s10586-017-0853-0 %T A Secure Key Agreement Protocol for Dynamic Group %U http://arxiv.org/abs/1704.02683 %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.

@misc{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 = {2017-04-16T17:42:19.000+0200}, author = {Bilal, Muhammad and Kang, Shin-Gak}, biburl = {https://www.bibsonomy.org/bibtex/271777451fd3e1c3c27cabc9fda709f5f/mbilalk84}, description = {A Secure Key Agreement Protocol for Dynamic Group}, doi = {10.1007/s10586-017-0853-0}, interhash = {353e04a2154d23a016aaac7f44e6b20a}, intrahash = {71777451fd3e1c3c27cabc9fda709f5f}, keywords = {Group confidentiality dynamic key multicast rekeying resource scalability 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}, timestamp = {2017-04-16T17:42:19.000+0200}, title = {A Secure Key Agreement Protocol for Dynamic Group}, url = {http://arxiv.org/abs/1704.02683}, year = 2017 }