IFS-2012-0352 (1) (original) (raw)
Related papers
Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O(1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.
Chinese remainder Theorem based centralised group key management for secure multicast communication
ET Information Security, 2013
Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O(1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.
Computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication
Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.
Computer Networks, 2007
This paper proposes an efficient protocol and associate algorithm for group key management in secure multicast. This protocol is based on a hierarchy approach in which the group is logically divided into subgroups. The group key is organized using member secrets assigned to each member and server secrets assigned to each subgroup, and the inverse value of the member secrets are also used to manage the group key when a member leaves. In this case, each member in a single subgroup needs to store the inverse values of the other members in that subgroup with the exception of its own. When a member joins the group, after updating the previous group key in the server, the new key is sent to all existing group members, and the inverse value of the new member is sent to subgroup members (where there is a join), by exploiting IP multicast. Most importantly, the server just sends the inverse value of the leaving member to the subgroups when a member leaves. Then, the group key is updated by each remaining member in the subgroups by using that inverse value. Consequently, the benefits are two-fold. First, only one key needs to be generated by the server at each event. Second, not only the computational overhead is reduced but also new key information can be multicast to all members simultaneously. This paper describes the details of our novel protocol and the related algorithm.
AN ENHANCED AND COST EFFECTIVE GROUP KEY MANAGEMENT SCHEME FOR MULTICAST NETWORK
Key management plays a vital role in the data communications. The proposed scheme is a key management scheme that provides more efficient and secure methods for key generation and utilization. Enhanced and cost effective key management scheme achieves a secure communication between the members within the group-based network. In this scheme, the group key is generated only once which is static. Hence, it reduces the computation cost at any change in the network like member leave and member join. This papers deals with the analysis of enhanced and cost effective key management scheme with respect to communication overhead, computation cost. The analysis shows that the proposed key management scheme comprises of the most reliable methods for key generations and hence, the data communication. Enhanced and cost effective key management scheme is compared to some of the other key management techniques and proved to be the better choice in this study.
Storage Efficient Key Management Technique for Secure Multicasting
Multicast communication will be the communication paradigm of future networks. Secure multicasting is a challenging issue. The main objective of secure multicasting is to distribute the group key to the current members of the group in a scalable manner with minimum overheads. The key distribution methods can be either centralized or distributed. Of these, the centralized methods are simple and robust. In the centralized models, the central controller is an important entity that takes care of key distribution and management. The burden on the central controller is very significant in the centralized models due to the overheads incurred by key distribution. To reduce the load on the central controller, a grouping mechanism based on the behavior of members and a novel key distribution pattern is employed. With this approach, the storage efficiency is improved and the communication bounds are preserved. A comparison in terms of the performance parameters, such as storage and communication updates of the proposed key tree, is made here between our model and the existing architectures. Our model has been simulated, and the results have been found to be optimal.
Improved Key Management Technique for Secure Multicasting over IP
Journal of Network and Systems Management, 2005
Multicast communication is going to be the communication paradigm of all future networks. Secure multicasting is a very vital problem in today's networks. In secure multicasting, the group members share a common key called the group key. Whenever the group members change, the group key must be changed. Therefore, many multicast security problems are abstracted into key management and distribution problems. The problem of distributing cryptographic keys to the group members in an optimum way that minimizes the communication and storage overheads are the important objectives of a secure multicast problem. In this paper, an efficient key management technique is proposed that minimizes the number of message exchanges and the number of keys stored. Existing key management methods have O(N) and O(log N) overheads. The proposed method shows further improvement. The model has been simulated and the results show improvements to existing approaches.
Computing Research Repository, 2009
With the evolution of the Internet, multicast communications seem particularly well adapted for large scale commercial distribution applications, for example, the pay TV channels and secure videoconferencing. Key management for multicast remains an open topic in secure Communications today. Key management mainly has to do with the distribution and update of keying material during the group life. Several key tree
A Secure Key Distribution Protocol for Multicast Communication
Providing efficient security method to support the distribution of multimedia multicast is a challenging issue, since the group membership in such applications requires dynamic key generation and updation which takes more computation time. Moreover, the key must be sent securely to the group members. In this paper, we propose a new Key Distribution Protocol that provides more security and also reduces computation complexity. To achieve higher level of security, we use Euler’s Totient Function ϕ(n) and gcd(ϕ(n)) in the key distribution protocol. Therefore, it increases the key space while breaking the re-keying information. Two major operations in this scheme are joining and leaving operations for managing group memberships. An N-ary tree is used to reduce number of multiplications needed to perform the member leave operation. Using this tree, we reduce the computation time when compared with the existing key management schemes.
Key Management Techniques for Dynamic Secure Multicasting: A Distributed Computing Approach
Most of the Internet applications today require multicasting. For example, software updates, multimedia content distribution, interacting gaming and stock data distribution require multicast services. All of these applications require privacy and authenticity of the participants. Most of the multicasting groups are dynamic and some of them are large in number. Only those users who belong to the multicasting group should receive the information and be able to decrypt it. New users joining the group should receive information immediately but should not understand the information that was released prior to their joining. Similarly, if users leave the group, they should not receive any further information and should not be able to decrypt it. Keys need to be distributed to the users belonging to the current session and hence some kind of key management is required. Existing schemes for secure multicasting are limited to small and static groups. To allow large and dynamic groups to use the services of multicasting, some protocols have been developed: Multicast Trees, Spanning Tree, Centralized Tree-Based Key Management, Flat-key Management and Distributed Key Management. Some of these schemes are better than others with respect to the speed, memory consumption, and amount of communication needed to distribute the keys. All these schemes are limited in performance with respect to the speed, memory consumption, and amount of communication needed in distributing the keys. In this thesis, a number of public and private key algorithms and key management techniques for secure and dynamic multicasting are studied and analyzed. The thesis is focused on the secure lock method developed by Chiou and Chen, using the Chinese Remainder Theorem. The protocol is implemented for a small group of users and its performance is studied. While, the secure lock method works well for a small group of users and the performance is degraded when the group grows in size. A protocol is proposed for a large and dynamic group, based on the idea of the Chinese Remainder Theorem. A performance study is carried out by comparing our proposed protocol with the existing multicasting protocols. The analysis shows that the proposed protocol works well for large and dynamic groups and gives significantly better performance.