logo
    The Design of Secure Group Communication with Contributory Group Key Agreement Based on Mobile Ad Hoc Network
    2
    Citation
    16
    Reference
    10
    Related Paper
    Citation Trend
    Abstract:
    A Group Key Agreement (GKA) protocol is necessary for establishing a group key among all of the group members over a public network. The protocol presents a fundamental challenge in secure and efficient group communications. Without the disadvantages of centralized method, Contributory Group Key Agreement (CGKA) is more suitable for dynamic groups. Recently, a Dynamic Asymmetric Group Key Agreement (DASGKA) protocol is proposed base on CGKA. The protocol allows dynamic joining or leaving solution to enhance efficiency in ad hoc networks. In this paper, we focus on the problem of the establishment of the group key. We propose a secure contributory group key agreement protocol based on ring structure. As a member joining or leaving the group, there are more designs about secure transmission and precise verification. Moreover, the issues about passive attack, unknown key-share, key freshness, contributiveness, backward secrecy and forward secrecy were analyzed in this paper. The results of the paper show that our protocol provides more robust and secure group communication.
    Keywords:
    Group key
    Forward secrecy
    Key-agreement protocol
    Pre-shared key
    Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.
    Group key
    Forward secrecy
    Key-agreement protocol
    Key encapsulation
    Security association
    In 2004, Hwang et al. proposed a group key exchange protocol for sharing a secure key in a group. Their protocol is an extension from the two party key exchange protocol to the group one. Recently, Jung-San Lee et al. noted that Hwang et al. group key exchange protocol has two security weaknesses. First, the forward secrecy is not confirmed in case that a new member joins the group and second, if a group member leaves the group, the backward secrecy is compromised. They proposed an improvement over this key exchange protocol in order to provide both forward and backward secrecy among group members. In this paper, we propose another improvement over Lee et al. key exchange, and we show that our key exchange protocol not only preservers both forward and backward secrecy, but also it is more efficient than their protocol when a member leaves the group. Finally, we give a formal analysis for the correctness of the proposed protocol via Scyther model checking tool.
    Forward secrecy
    Group key
    Key-agreement protocol
    Oakley protocol
    To meet the increasing popularity of secure group-oriented computing, this paper proposed an efficient group key agreement scheme-PAGKA. It combines the merit of key tree and Pairings-based key exchange, and involves members' long-term keys and session random in the group key to avoid dependence on signature or MAC. The PAGKA protocol suite is communication efficient, and has the following cryptographic properties such as key independence, implicit key authentication, perfect forward secrecy and resistance to known-key attacks and man-in-the-middle attacks. The idea in PAGKA can be used as a general method to extend authenticated two-party key agreement protocol to group settings.
    Forward secrecy
    Group key
    Session key
    Key-agreement protocol
    Authenticated Key Exchange
    Pre-shared key
    Oakley protocol
    Citations (0)
    With the rapid development of mobile networks, there are more and more application scenarios that require group communication. For example, in mobile edge computing, group communication can be used to transmit messages to all group members with minimal resources. The group key directly affects the security of the group communication. Most existing group key agreement protocols are often flawed in performance, scalability, forward or backward secrecy, or single node failure. Therefore, this paper proposes a blockchain-based authentication and dynamic group key agreement protocol. With our protocol, each group member only needs to authenticate its left neighbor once to complete the authentication, which improved authentication efficiency. In addition, our protocol guarantees the forward secrecy of group members after joining the group and the backward secrecy of group members after leaving the group. Based on blockchain technology, we solve the problem of single node failure. Furthermore, we use mathematics to prove the correctness and security of our protocol, and the comparison to related protocols shows that our protocol reduces computation and communication costs.
    Group key
    Forward secrecy
    Key-agreement protocol
    Citations (13)
    Several identity-based key agreement protocols using bilinear pairing have been proposed in recent years and none of them has achieved all required security properties. In this paper, we firstly propose an ID-based one round authenticated group key agreement protocol with bilinear pairings, where all participants can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, every user’s private key can be proved to be secure. Also an extended version of one round authenticated group key agreement protocol is given, it provide perfect forward secrecy and avoid key escrow by the Key Generation Center.  Finally, a comprehensive security analysis and a comprehensive security analysis are provided. By comparing with other protocols, the proposed protocol requires lower computation cost.
    Forward secrecy
    Group key
    Key-agreement protocol
    Key escrow
    Session key
    Discrete logarithm
    SUMMARY A fault‐tolerant group key agreement is an essential infrastructure for Internet communication among all involved participants; it can establish a secure session key no matter how many malicious participants exit simultaneously in an effort to disrupt the key agreement process. Recently, Zhao et al . proposed an efficient fault‐tolerant group key agreement protocol named efficient group key agreement that can resist denial‐of‐service attacks, reply attacks, man‐in‐middle attacks, and common modulus attacks; it can also preserve forward secrecy with lower computational cost than previous protocols. We show that it is still vulnerable to active attacks by malicious participants and modify the corresponding security weakness adaptively. Furthermore, we propose an efficient fault‐tolerant group key agreement based on a binary tree structure and enhance it to a dynamic setting where participants can leave or join the group arbitrarily according to their preferences with instant session key refreshment. Additionally, our session key refreshment is based on secure key updating to protect forward/backward confidentiality and is resistant to active/passive attacks. The performance analysis shows that our proposed protocol has lower computational cost and little additional communication cost exploiting dynamic setting. Copyright © 2013 John Wiley & Sons, Ltd.
    Forward secrecy
    Group key
    Key-agreement protocol
    Session key
    Citations (14)
    As there is growth in the need of applications such as video conferencing and interactive chatting, secure group communication is an important research area. Security in these applications is necessary to provide services like privacy, data-integrity, and non-repudiation to group members. A naive way to achieve security in such groups is to have a secret key among every node. This task is achieved by means of a contributory group key agreement protocol that each member directly contributes to key management and generation. In 2007, Heo et al. [4] proposed certificateless authenticated group key agreement (CAGKA) protocol. While their protocol provides efficient communication and computation complexity, it does not provide (perfect) forward secrecy desired for a secure group key agreement protocol. In this paper, a certificateless authenticated group key agreement protocol is proposed based on CCEGK and EAGKA. The proposed protocol also satisfies security requirements and is suitable for dynamic membership events.
    Group key
    Forward secrecy
    Key-agreement protocol
    Citations (19)
    Many applications in distributed computing systems, such as IP telephony, teleconferencing, collaborative workspaces, interactive chats and multi-user games, involve dynamic peer groups.In order to secure communications in dynamic peer groups, group key agreement protocols are needed.In this paper, we come up with a new group key agreement protocol, composed of a basic protocol and a dynamic protocol, for large-scale dynamic peer groups.Our protocols are natural extensions of one round tripartite Diffie-Hellman key agreement protocol.In view of it, our protocols are believed to be more efficient than those group key agreement protocols built on two-party Diffie-Hellman key agreement protocol.In addition, our protocols have the properties of group key secrecy, forward and backward secrecy, and key independence.
    Group key
    Key-agreement protocol
    Forward secrecy
    Citations (1)
    To achieve security in a dynamic collaborative peer group,group key agreement protocol should be provided.Two-party key agreement protocol based on the weil pairing protocol(A-WGKA2) was proposed in this paper.It may establish a secret key between two nodes and authenticate each other by fewer messages.The proposed protocol has the security properties such as forward secrecy,no unknown key-share,known session key security,no key control and no key-compromise impersonation.Further,we proposed a group key agreement protocol using weil pairing referred as A-WGKAn that was adapted to the dynamic collaborative peer groups.In the A-WGKAn protocol,the A-WGKA2 protocol was employed on key tree to establish and allocate group key.Therefore,it not only has low computational overhead and communication costs but also provides the node authentication.
    Forward secrecy
    Group key
    Key-agreement protocol
    Oakley protocol
    Session key
    Security association
    Otway–Rees protocol
    Citations (0)
    The majority of currently used conventional group key distribution protocols are primarily created for a single group. But group communications are becoming more and more popular as networks improve quickly. So all participating users must share or exchange a secure group key beforehand in order to protect communication and multi-group key installations are necessary for many group-oriented applications at the moment. This allows users to join numerous groups at once. A novel type of user-oriented multi-group key setups employing secret sharing was recently provided by C.F. Hsu et al. in 2018 (UMKESS). This protocol, like many other group key establishment systems, is polynomial-based, requiring both the key generation center (KGC) and each group member to resolve t-degree approximating polynomials in order to distribute and retrieve the secret group key. N. Shruti et al in 2018 suggested a user-friendly group key distribution mechanism uses secret sharing with circulate matrices.in this article we have improved performance security of previous protocol by using two techniques, ECDH exchange protocol to generate sharing secret key with using it as key in term of Diophantine equations in second degree. Security analysis is displayed that our suggested technique more effective, secure, robust and achieves the key security, provides forward and back-ward secrecy, prevents insider and out sider attacks. Povzetek: izboljšanje varnosti delovanja protokola UMK GM TP.
    Group key
    Forward secrecy
    Key-agreement protocol
    Security association
    Pre-shared key
    Key encapsulation
    Oakley protocol
    Citations (0)