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

TELKOMNIKA Indonesian Journal of Electrical Engineering

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

Published Oct 1, 2014• 0 citations
Publisher
DOI
10.11591/telkomnika.v12i10.5582

Related papers

A Flexible ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences•Feb 27, 2013•0 citations

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

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.

Indonesian Journal of Electrical Engineering and Computer Science•Oct 1, 2014•0 citations

A New Group Key Agreement Protocol with Anonymity

Gang Yao, Li Guo

Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.

Applied Mechanics and Materials•Aug 30, 2013•0 citations

A group key agreement protocol based on ECDH and short signature

Zeyu Yang, Ziqing Wang, Fei Qiu +1 more

Journal of Information Security and Applications•Dec 5, 2022•20 citations

Identity Based Authenticated Group Key Agreement Protocol

K. C. Reddy, Divya Nalla

Lecture notes in computer science•Jan 1, 2002•48 citations

1-round dynamic group key agreement

YE Cheng-qing

Among the conventional round group key agreement protocol,the minimal number of message exchange round is 2.The efficiency of the protocol is affected by the number of message exchange round.Using a secret shared technology that two parties share a common static secret without any interaction between them,an efficient one-round ID-based authenticated group key agreement scheme was proposed and extended to the dynamic group.The number of message exchanged during the key agreement in this one-round protocol is reduced to half of that in two-round protocols.So the efficiency of its communication is improved.The proposed scheme was proved to be secure and be forward and backward secure,and can be applied to the secure group communication where the perfect forward secure is not needed.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2007•0 citations
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.
Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.
Among the conventional round group key agreement protocol,the minimal number of message exchange round is 2.The efficiency of the protocol is affected by the number of message exchange round.Using a secret shared technology that two parties share a common static secret without any interaction between them,an efficient one-round ID-based authenticated group key agreement scheme was proposed and extended to the dynamic group.The number of message exchanged during the key agreement in this one-round protocol is reduced to half of that in two-round protocols.So the efficiency of its communication is improved.The proposed scheme was proved to be secure and be forward and backward secure,and can be applied to the secure group communication where the perfect forward secure is not needed.