DATA SECURITY AND PRIVACY IN GROUP BASED ENVIRONMENT USING MULICAST KEY MANAGEMENT AND MAJORITY BASED VOTING PROTOCOL (original) (raw)
Related papers
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.
SECURITY USER DATA IN LOCAL CONNECTIVITY USING MULTICAST KEY AGREEMENT
In this paper, we study Group key agreement means multiple parties want to create a common secret key to be used to exchange information securely. The group key agreement with an arbitrary connectivity graph, where each user is only aware of his neighbor and has no information about the existence of other users. Further, he has no information about the network topology. We implement the existing system with more time efficient manner and provide a multicast key generation server which is expected in future scope by current authors. We replace the Diffie Hellman key exchange protocol by a new multicast key exchange protocol that can work with one to one and one to many functionality. We also tend to implement a strong symmetric encryption for improving file security in the system. Through experimentation we find the time required for join and leave part as well as time required for encryption is much less as compared to existing methodologies. I. INTRODUCTION In dispersed system, I gathering key assention convention assumes a vital part. They are intended to give a gathering of clients with a common mystery key such that the clients can safely speak with one another over an open system. Gathering key understanding means numerous gatherings need to make a typical mystery key to be utilized to trade data safely. We think about the gathering key concurrence with a self-assertive network diagram, where every client is just mindful of his neighbors and has no data about the presence of different clients. Further, he has no data about the system topology. In our issue, there is no focal power to instate clients. Each of them can be instated autonomously utilizing PKI. A gathering key assention for this setting is exceptionally suitable for applications, for example, an interpersonal organization. Under our setting, we develop two productive latently secure conventions. We likewise demonstrate lower limits on the round Complexity which shows that our conventions are round proficient. In specially appointed system, the clients are typically portable. The gathering part is not known ahead of time and the clients may join and leave the gathering much of the time. In such situations, element gathering key understanding conventions are needed. Such plans must guarantee that the gathering session key overhauls upon gathering part changing such that consequent session keys are shielded from the leaving individuals and past session keys are shielded from the joining individuals. There are very much various element gathering key understanding conventions. Client security implies that any leaving part from a gathering can't produce new gathering and joining part into a gathering can't find beforehand utilized gathering key.In this task we actualize the current framework with additional time productive way and give a multicast key era server which is normal in future extension by current creators. We supplant the Diffie Hellman key trade convention by another multicast key trade convention that can work with balanced and one to numerous usefulness. We likewise tend to execute an in number symmetric encryption for enhancing document security in the framework.
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.
A SURVEY ON GROUP KEY AGREEMENT FOR SECURELY SHARING A SECRET KEY
Key management, particularly in a group setting, is the corner stone for all other security services. As a result of the increased popularity of group-oriented applications and protocols, group communication occurs in lots of different settings: from network multicasting to application layer teleconferencing and video conferencing. Apart from of the application environment, security services are required for providing communication privacy and integrity. This fundamentally rules out the traditional key distribution paradigm because it calls for superior trust in the group member who generates and distributes keys. We focus on a group key agreement problem with local connectivity, where a user is only aware of his neighbors while the connectivity graph is arbitrary. There is no central authority to initialize the users. A group key agreement with these features is very suitable for social networks. We propose two efficient protocols with passive security: Diffie Hellman Key Agreement (DH-KA) protocol and a private coin tossing protocol protected by Diffie Hellman key (XO-KA). Finally, an actively secure protocol is constructed from a passively secure protocol by developing a two-stage protocol.
Efficient Key Generation for Multicast Groups Based on Secret Sharing
International Journal of Engineering Research and Applications, 2010
Secure multicast represents the core component of many web and multimedia applications such as payTV, telecon-ferencing, real-time distribution of stock market price and etc. The main challenges for secure multicast is scalability, efficiency and authenticity. In this project, we propose a scalable, efficient, authenticated group key agreement scheme for large and dynamic multicast systems. The proposed key agreement scheme is identity-based which uses the bilinear map over the elliptic curves. Compared with the previously published schemes, our scheme provides group member authenticity without imposing extra mechanism. Furthermore, we give a scalability solution based on the subgroups, which has advantages over the existing schemes. Security analysis shows that our scheme satisfies both forward secrecy and backward secrecy.
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.
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.
A scalable and distributed multicast security protocol using a subgroup-key hierarchy
Computers & Security, 2004
In the present paper, a scalable protocol for securing multicast communication is proposed. The proposed protocol is based on the idea of dividing the whole group into smaller subgroups as in the Iolus protocol. For a member join or leave, the decomposition of the group into smaller subgroups will reduce the computation complexity from O(M), where M is the number of the whole group members, to O(N), where N is the number of the subgroup members. Moreover, each subgroup is organized in a logical key hierarchy as in the LKH protocol. The use of logical key hierarchy will reduce the computation complexity cost from O(N) to OðlogðNÞÞ in case of member leave/join. Furthermore, the number of communicating messages containing the changed keys will be reduced. The proposed protocol is compared with the two well-known protocols: Iolus and LKH. The comparison is undertaken according to two criteria: the cost of encryption required for the rekey operation in case of member join or leave and the length of the re-key message. The results show that the proposed protocol outperforms both the Iolus and the LKH protocols. Therefore, the proposed protocol will enhance the group performance in terms of computation and communication. ª
IRJET-A SURVEY ON GROUP KEY AGREEMENT FOR SECURELY SHARING A SECRET KEY
Key management, particularly in a group setting, is the corner stone for all other security services. As a result of the increased popularity of group-oriented applications and protocols, group communication occurs in lots of different settings: from network multicasting to application layer teleconferencing and video conferencing. Apart from of the application environment, security services are required for providing communication privacy and integrity. This fundamentally rules out the traditional key distribution paradigm because it calls for superior trust in the group member who generates and distributes keys. We focus on a group key agreement problem with local connectivity, where a user is only aware of his neighbors while the connectivity graph is arbitrary. There is no central authority to initialize the users. A group key agreement with these features is very suitable for social networks. We propose two efficient protocols with passive security: Diffie Hellman Key Agreement (DH-KA) protocol and a private coin tossing protocol protected by Diffie Hellman key (XO-KA). Finally, an actively secure protocol is constructed from a passively secure protocol by developing a two-stage protocol.
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.