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

Advances in intelligent systems and computing

Design of Attribute Based Authenticated Group Key Agreement Protocol Without Pairing

Reshu Verma, Abhimanyu Kumar

Published Jan 1, 2020• 3 citations
Publisher
DOI
10.1007/978-3-030-39875-0_10

Related papers

Design and analysis of one-round certificateless authenticated group key agreement protocol with bilinear pairings.

SK Hafizul Islam, Abhishek Singh

•Jan 1, 2014•0 citations

Authenticated Group Key Agreement Protocol Without Pairing

Gaurav Sharma, Rajeev Anand Sahu, Veronika Kuchta +2 more

Lecture notes in computer science•Jan 1, 2018•5 citations

A Dynamic ID Based Authenticated Group Key Agreement Protocol from Pairing.

Shruti Nathani, B. P. Tripathi, Shaheena Khatoon

International journal of network security•Jan 1, 2019•9 citations

A New Design of Asymmetric Group Key Agreement Protocol without any Third Party Controller

Shruti Nathani, B. P. Tripathi

Recently in 2016, to authenticate the group members Li et al. uses the identity based public key cryptography in their proposed authenticated and dynamic round optimal asymmetric group key agreement protocol(ADASGKA). Inspire from this ADASGKA protocol in this paper we propose a new identity based authenticated and dynamic asymmetric group protocol using bilinear pairing without any extra third party controller. Our security analysis shows that the proposed protocol can resist all the required attacks and satisfies the desirable security attributes.

International journal of tomography and simulation•Sep 26, 2020•0 citations

Identity Based Authenticated Group Key Agreement Protocol

K. C. Reddy, Divya Nalla

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

An Improved secure certificateless authenticated group key agreement protocol

Manman Geng, Futai Zhang

In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)•Nov 1, 2009•1 citation
Recently in 2016, to authenticate the group members Li et al. uses the identity based public key cryptography in their proposed authenticated and dynamic round optimal asymmetric group key agreement protocol(ADASGKA). Inspire from this ADASGKA protocol in this paper we propose a new identity based authenticated and dynamic asymmetric group protocol using bilinear pairing without any extra third party controller. Our security analysis shows that the proposed protocol can resist all the required attacks and satisfies the desirable security attributes.
In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.