Two provable secure ID-based group Key agreement protocols

Abstract

Currently, most of published key agreement protocols cannot provide perfect forward seorecy and avoid key escrow by Key Generation Center (KGC). Here, with bilinear pairings we firstly propose an ID-based one round authenticated group key agreement protocol (OR-AGKA), which can satisfy the required security attributes. Subsequently, we give the extension of OR-AGKA (EOR-AGKA), which is a flexible protocol because we can arbitrarily construct subgroups in the proceeding of group key agreement. Finally, we analyze the security of the proposed protocols using provable security methods. We also show that the protocol EOR-AGKA can provide lower computation cost.