An ID-based Dynamic Authenticated Group Key Agreement Scheme with Optimal Round Complexity from Pairings

This paper presents an identity-based dynamic authenticated group key agreement (DAGKA) protocol with following advantages. The algorithms of Setup and Join has only one round communication. There is no message exchange among members in Leave algorithm. Joining members cannot know previous session keys and leaving members cannot know future session keys. Its AKE-security is proved under Decisional Bilinear Diffie-Hellman (DBDH) assumption. The protocol can resist key control attack and has forward security.

[1]  K. C. Reddy,et al.  Identity Based Authenticated Group Key Agreement Protocol , 2002, INDOCRYPT.

[2]  Ratna Dutta,et al.  Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting , 2008, IEEE Transactions on Information Theory.

[3]  Zhong Chen,et al.  Hierarchical identity-based encryption without key delegation in decryption , 2014, Int. J. Grid Util. Comput..

[4]  Emmanuel Bresson,et al.  Provably authenticated group Diffie-Hellman key exchange , 2001, CCS '01.

[5]  Chunming Tang,et al.  An ID-based authenticated dynamic group key agreement with optimal round , 2011, Science China Information Sciences.

[6]  Yi Mu,et al.  Efficient ID-Based Authenticated Group Key Agreement from Bilinear Pairings , 2006, MSN.

[7]  Yumin Wang,et al.  Versatile identity-based signatures for authentication in multi-user settings , 2014, Int. J. Grid Util. Comput..

[8]  Jianhua Li,et al.  ID-based one round authenticated group key agreement protocol with bilinear pairings , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[9]  Dong Hoon Lee,et al.  Efficient ID-based Group Key Agreement with Bilinear Maps , 2004, Public Key Cryptography.

[10]  Rainer Steinwandt,et al.  Communication-Efficient 2-Round Group Key Establishment from Pairings , 2011, CT-RSA.

[11]  Colin Boyd,et al.  Generic One Round Group Key Exchange in the Standard Model , 2009, ICISC.

[12]  Emmanuel Bresson,et al.  Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions , 2002, EUROCRYPT.

[13]  Yanqin Zhu,et al.  Leakage-resilient identity-based encryption scheme , 2010, The 6th International Conference on Networked Computing and Advanced Information Management.

[14]  Jin Cao,et al.  Group-based authentication and key agreement for machine-type communication , 2014, Int. J. Grid Util. Comput..

[15]  Jonathan Katz,et al.  Scalable Protocols for Authenticated Group Key Exchange , 2003, Journal of Cryptology.

[16]  Dong Hoon Lee,et al.  Constant-Round Authenticated Group Key Exchange for Dynamic Groups , 2004, ASIACRYPT.

[17]  Soumyadev Maity,et al.  An authentication protocol for vehicular ad hoc networks with heterogeneous anonymity requirements , 2014, Int. J. Space Based Situated Comput..

[18]  Emmanuel Bresson,et al.  Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case , 2001, ASIACRYPT.

[19]  Rainer Steinwandt,et al.  Secure group key establishment revisited , 2007, International Journal of Information Security.

[20]  Chak-Kuen Wong,et al.  A conference key distribution system , 1982, IEEE Trans. Inf. Theory.