Melisa Hajyvahabzadeh, Elina Eidkhani, S. A. Mortazavi, Alireza Nemaney Pour
{"title":"A New Group Key Management Protocol Using Code for Key Calculation: CKC","authors":"Melisa Hajyvahabzadeh, Elina Eidkhani, S. A. Mortazavi, Alireza Nemaney Pour","doi":"10.1109/ICISA.2010.5480553","DOIUrl":null,"url":null,"abstract":"This paper presents a new group key management protocol, CKC (Code for Key Calculation). This protocol is based on logical key hierarchy. When a new member joins the group, server sends only the group key for that member. Then, current members and the new member calculate the necessary keys using node codes and one-way hash function. Node code is a code which is assigned to each node of the key tree. Again at leave, server just sends the new group key to remaining members. By this key, members calculate necessary keys using node codes and one-way hash function. The security of the keys is based on one-wayness of hash function. The results show that CKC reduces computational and communication overhead and message size at join while it keeps minimized the overhead of key update at leave.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISA.2010.5480553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17
Abstract
This paper presents a new group key management protocol, CKC (Code for Key Calculation). This protocol is based on logical key hierarchy. When a new member joins the group, server sends only the group key for that member. Then, current members and the new member calculate the necessary keys using node codes and one-way hash function. Node code is a code which is assigned to each node of the key tree. Again at leave, server just sends the new group key to remaining members. By this key, members calculate necessary keys using node codes and one-way hash function. The security of the keys is based on one-wayness of hash function. The results show that CKC reduces computational and communication overhead and message size at join while it keeps minimized the overhead of key update at leave.
提出了一种新的组密钥管理协议CKC (Code for key Calculation)。该协议基于逻辑密钥层次结构。当新成员加入组时,服务器只发送该成员的组密钥。然后,当前成员和新成员使用节点代码和单向散列函数计算所需的密钥。节点代码是分配给键树的每个节点的代码。同样,在离开时,服务器只向剩余成员发送新的组密钥。通过此键,成员使用节点代码和单向散列函数计算必要的键。密钥的安全性基于哈希函数的单向性。结果表明,CKC在连接时减少了计算和通信开销以及消息大小,同时在离开时保持了最小的键更新开销。