An ID-based Dynamic Authenticated Group Key Agreement Scheme with Optimal Round Complexity from Pairings
Fei Li, Dongqing Xie, Wei Gao, Xu An Wang, Jianhua Yan · 2016
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.