Loading...
Search for:
group-key-management
0.005 seconds
An efficient group key management protocol using code for key calculation: CKC
, Article Telecommunication Systems ; Volume 51, Issue 2-3 , 2012 , Pages 115-123 ; 10184864 (ISSN) ; Eidkhani, E ; Mortazavi, S. A ; Nemaney Pour, A ; Sharif University of Technology
2012
Abstract
This paper presents a new group key management protocol, CKC (Code for Key Calculation) for secure IP multicast. In this protocol which is based on logical key hierarchy, only the group key needs to be sent to new member at join. Then, using the group key current members and the new member calculate the necessary keys by node codes and one-way hash function. A node code is a random number assigned to each node to help users calculate necessary keys. Again, at leave server just sends the new group key to the 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...
Simultaneous Group Membership with Members Collaboration in Wireless Networks Using Hierarchical Approach
, M.Sc. Thesis Sharif University of Technology ; Nemaney Pour, Alireza (Supervisor)
Abstract
Recently, demand for using variant applications in distributed networks has been increased largely. Most of these applications are based on group communication.In distributed group communication, two important factors need to be considered, group construction, and Group Key Management (GKM). The group construction specifies the process of constructing a new group by cooperation between distributed users. As well, GKM ensures re-freshness of the group key after each join/leave operation. Both of these tasks must be done by collaboration between members. This leads to imposing complexity and communication overhead to the system.This thesis proposes efficient methods for group construction and...
An efficient distributed group key management using hierarchical approach with Diffie-Hellman and symmetric algorithm: DHSA
, Article 2011 International Symposium on Computer Networks and Distributed Systems, CNDS 2011, 23 February 2011 through 24 February 2011, Tehran ; 2011 , Pages 49-54 ; 9781424491544 (ISBN) ; Pour, A. N ; Kato, T ; Sharif University of Technology
2011
Abstract
This paper proposes an efficient many-to-many group key management protocol in distributed group communication. In this protocol, group members are managed in the hierarchical manner logically. Two kinds of keys are used, asymmetric and symmetric keys. The leaf nodes in the key tree are the asymmetric keys of the corresponding group members and all the intermediate node keys are symmetric keys assigned to each intermediate node. For asymmetric key, Diffie-Hellman key agreement is introduced. To calculate intermediate node keys, members use codes assigned to each intermediate node key tree. Group members calculate intermediate node keys rather than distributed by a sponsor member. The...
Group Communication in Secure Multicast for Wireless Networks Using One-Time Password
, M.Sc. Thesis Sharif University of Technology ; Nemaney Pour, Alireza (Supervisor)
Abstract
Recently, the number of requests for multicast services through the wireless networks has increased. However, for successful deployment of these services, security and efficiency of content delivery must be provided at first. This thesis presents a new approach for secure multicast in wireless networks. This approach, CRAW (Combination of Re-keying and Authentication in Wireless networks) combines member authentication procedure with group key management protocol together to provide efficient re-keying. One-time password is proposed for member authentication and CKC (Code for Key Calculation) is suggested for group key management in wireless networks. In fact, the combination of...
Simultaneous Group Membership for Key Management in Secure IP Multicast Using Hierarchical Approach
, M.Sc. Thesis Sharif University of Technology ; Nemaney Pour, Alireza (Supervisor)
Abstract
This research presents an efficient group key management protocol, CKCSS (Code for Key Calculation in Single and Simultaneous join/leave) for secure multicast. In this research, we propose a new protocol to reduce the key management overheads for single join/leave at first and then use the development of this technique for simultaneous one. This protocol is based on logical key hierarchy. In this protocol, when new members join the group, server sends only the group key to those new members. Then, current members and the new members calculate all the necessary keys by node codes and one-way hash function. A node code is a random number assigned to each key to help users calculate the...
A new group key management protocol using code for key calculation: CKC
, Article 2010 International Conference on Information Science and Applications, ICISA 2010, 21 April 2010 through 23 April 2010 ; April , 2010 ; 9781424459438 (ISBN) ; Eidkhani, E ; Mortazavi, S. A ; Nemaney Pour, A ; Sharif University of Technology
2010
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...