Self-Similar key generation for secure communication in multimedia applications (original) (raw)
Related papers
Secure Group Communication based on Elliptic Curve Cryptography
Group key management is an important functional building block for any secure multicast architecture. In this regards, it is identified some security issues in the group key management when a user join or leave the group then forward secrecy and backward secrecy issues comes in the multicast networks. This paper provides an efficient and improve mechanism for group key management solutions with computational and communication overhead are less while rekeying cost also minimize. The proposed approached is known as Elliptic Curve Cryptography (ECC) based secure Group Communication.
Secure Message Transmission Using Centralized Group Key Distribution Protocol
International Journal for Research in Applied Science & Engineering Technology (IJRASET), 2022
In the secure message transmission, transmitted information can only receive by the authorized group members. To achieve a secure communication, symmetric key (group key) is used to both encrypt and decrypt the information, that shared among the group members. This paper, proposes an efficient centralized group key management scheme (GKDP) for achieving a secure multicast communication between the group members that reduces the cost of computation of SERVER(S) and rekeying cost of group members. The group key (GK) generated in the multicast network is securely distributed with the help of the RSA cryptosystem. Whenever the new member joins the group, computation cost of S reduced by performing single addition, multiplication and encryption, for updating the group key (GK). Whenever the member leaves the group, S performs single subtraction, division and encryption, for updating the group key (GK). By comparing with existing group key management protocol, the proposed protocol has significantly reduced computation complexity and rekeying cost. The proposed protocol is tested on star topology, the test results compared with existing group key management protocol. The comparison results show that the proposed protocol is efficient in terms of reducing the computational complexity of S and rekeying cost of group members.
Elliptic Curve for Secure Group Key Management in Distributed Network
With the sudden growth in technology and network, group communication has become an increased concern in terms of security. A secure group communication can be defined as a situation where a set of users communicate with each other through messages in such a way that anyone outside the set will be unable to gather any information even if they can obstruct the message. Confidentiality, integrity and authentication are the basic security services provided by any trustworthy group communication system. Group key management lay the basis for these services. So it is very necessary to ensure these services for efficient group communication. Generally group key management protocol are classified into following three schemes: 1) Centralized: A centralized group key server take the responsibility of distributing and updating the group key to all the members in the network. But, a breakdown of key server will affect all the group application system. This is a major limitation of this scheme. 2) Decentralized: The groups are divided into different subgroups and a group key is shared between all group members. Every subgroup share a common subgroup key. Every group have a group key server (GK) which server all members in group and every subgroup have a subgroup key sever (SGK) which serve the subgroup members. 3) Distributed: In the distributed group management protocols, each individual member in the group is responsible for new group key generation and distribution. It is the most complex and difficult protocol. But, it is the best option for networks such as MANET. 4) Here we design an application of elliptic curve cryptography in a distributed network such as MANET. A MANET is a continuously self organizing and self configuring network. It is an application for distributed system with no particular infrastructure and base station. For confidentiality, members of the network exchange group keys for every membership change. This causes high computation overhead in the network.
An efficient group key agreement protocol for secure P2P communication
Security and Communication Networks, 2016
The efficient design of a distributed group key management for a peer to peer (P2P) network with minimal computation complexity in dynamic secure group communication is a challenging issue. This is because of the absence of a centralized coordinator. In order to provide this facility, a self-composed distributed group key management framework is proposed for secure P2P communication. In this proposed work, group key computation is performed using Chinese remainder theorem and secure communication is performed through RSA encryption algorithm. This self-composed key management is a one round protocol in which a shared group key is generated using the public key of each individual user, and it is derived from the respective private key. The main advantage of the group key management scheme proposed in this paper is that it reduces the computation complexity of the peer users to O(1). This reduction in computation complexity is achieved by performing one addition and multiplication operation during a single member join and one subtraction operation during a single member leave operation. The proposed algorithm has been implemented and analyzed with well-known existing distributed group key management protocols and observed that it reduces the computation complexity significantly.
Securing Group Based Communication System Using Multicast Key Agreement
In this paper, here is an investigation of Group key understanding means numerous gatherings need to make a typical mystery key to be utilized to trade data safely. The gathering key concurrence with a self-assertive availability chart, where every client is just mindful of his neighbor and has no data about the presence of different clients. Further, he has no data about the system topology. Here actualize the current framework with additional time effective way and give a multicast key era server which is normal in future extension by current creators. Here a substitution of the Diffie Hellman key trade convention by another multicast key trade convention that can work with coordinated and one to numerous usefulness. Likewise tend to execute a solid symmetric encryption for enhancing document security in the framework.
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.
Tree and elliptic curve based efficient and secure group key agreement protocol
Journal of Information Security and Applications, 2020
Group Key Agreement Protocol (GKAP) is a cryptographic mechanism where members of a group agree on a common key by sharing their blinded keys over a public channel. Sharing a key over a public channel is a security threat and expensive in terms of communication cost. In this paper, we proposed the GKAP based on tree and elliptic curve. For reducing the communication cost, we have used the divide-and-conquer mechanism with that group is divided into small subgroups and forming a tree-like structure. The modified Elliptic-Curve-Diffie-Hellman used for sharing the blinded key over a public network channel securely. This paper discussing different group key management operations are initialization, join, mass join, leave, mass-leave, merge with their communication cost are the number of rounds, unicast cost, broadcast cost, messages. This paper discussing the establishment of common keys not only for the group but also for the subgroups. Based on communication cost, we have compared the performance of proposed method with the existing approaches like Communication-Computation Efficient Group Key Algorithm (CCEGK), Tree-based group key agreement (TGDH), Ternary-tree based group key agreement protocol for dynamic group (TTGKAP), Group key generation tree protocol (GKGT), Ternary tree-based group key agreement protocol over elliptic curve for dynamic group (TTEGKAP), Efficient Group key agreement using hierarchical key tree (EGKAKT). From performance analysis, it is cleared that proposed approach performed better in most of the cases than the existing approaches. The proposed approach is safe against passive attack, collaborative attack, forward secrecy, backward secrecy, and man-in-themiddle attack.
A Centralized Key Table based Communication Efficient Group Key Management Protocol
International Journal of Computer Network and Information Security, 2015
Group key management is an integral part of secure multicast. Minimizing the number of rekeying messages, maintaining the forward and backward secrecy has always been a challenging task. Though there are many solutions which reduce the rekeying messages from () to () they increase with the increase in group size. In this paper, we present a centralized key table based communication efficient group key management protocol in which number of rekeying messages is independent of the group size. In this protocol key management server (KMS) divides a group of members into subgroups of size and maintains a table of subkeys along with member ID and one group key. Each member has subkeys, which is a subset of subkeys of KMS and one group key. The proposed protocol requires only one multicast rekeying message per joining of a new member as well as per eviction of any existing member. As the number of rekeying messages is not dependent on group size, it requires less computation.
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.
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.