Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications technology

Design and Analysis of Dynamic Group Key Agreement Protocol with UC Security

Yang Chun-ya

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

Aiming at the fact that the concurrent group key agreement( GKA) protocol is discussed only within the isolate model,and based on m-ary tree decisional Diffie-Hellman within the framework of universally composable( UC) security,a group key agreement protocol is designed,and the ideal functionality model for GKA protocol formulated. The security modular design and implementation of GKA protocol indicates that this protocol could meet the requirement of UC security. Compared with the similar protocol of GKA,this new protocol has the advantages of less communication and computation overhead,while supports group members in their dynamic joining and exiting.

Related papers

Group Key Agreement Protocol Based on Privacy Protection and Attribute Authentication

Zhang Qikun, Yongjiao Li, Yong Gan +3 more

Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones.

IEEE Access•Jan 1, 2019•27 citations

Universally composable asymmetric group key agreement protocol

Yong Chen, Mingxing He, Shengke Zeng +1 more

We analyze the security of asymmetric group key agreement (ASGKA) protocol in the universal composability (UC) framework. An ideal functionality that is suitable for ASGKA protocol is proposed. And we show that the ASGKA protocol securely realizes the proposed ideal functionality that can resist attacks by malicious insiders. The UC framework allows the protocols to guarantee their security under arbitrary protocol environment.

International Conference on Information, Communications & Signal Processing (ICICS)•Dec 1, 2015•1 citation

Novel group authenticated key agreement protocol in ternary tree structure

Zhang Longxian

Group Key Agreement(GKA)is an important research point in key establishment field. This paper proposes a new ID-based GKA protocol in ternary tree structure. It also considers the situation when some participants change. It discusses the security and computational cost of the new scheme. The result shows that the new protocol realizes the secure key agreement with lower computational cost.

Computer Engineering and Applications Journal•Jan 1, 2013•0 citations

Efficient Authenticated ID-Based Group Key Agreement Protocol

M Arifi, Mahmoud Gardeshi

Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie- Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Dif- fie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree struc- ture is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more effi- cient than other protocols with similar structure and also satisfies all known security requirements .

•Jan 1, 2011•1 citation

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Jun Zheng, Cheng Yang, Jinrong Xue +1 more

Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.

National Conference on Electrical, Electronics and Computer Engineering (NCEECE)•Jan 1, 2016•12 citations

Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications

Lei Zhang, Qianhong Wu, Josep Domingo‐Ferrer +2 more

Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k -bilinear Diffie-Hellman exponent assumption.

IEEE Transactions on Information Forensics and Security•Jun 19, 2015•69 citations
Aiming at the fact that the concurrent group key agreement( GKA) protocol is discussed only within the isolate model,and based on m-ary tree decisional Diffie-Hellman within the framework of universally composable( UC) security,a group key agreement protocol is designed,and the ideal functionality model for GKA protocol formulated. The security modular design and implementation of GKA protocol indicates that this protocol could meet the requirement of UC security. Compared with the similar protocol of GKA,this new protocol has the advantages of less communication and computation overhead,while supports group members in their dynamic joining and exiting.
Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones.
Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie- Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Dif- fie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree struc- ture is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more effi- cient than other protocols with similar structure and also satisfies all known security requirements .
Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.
Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k -bilinear Diffie-Hellman exponent assumption.