Authenticated Tree Based Group Key Agreement
Weijia Jiang, Jiguo Li · 2009
Secure and reliable group communication is an active area of research. Its popularity is caused by the growing importance of group-oriented and collaborative applications. The central research challenge is secure and efficient group key management. In this paper, we present a provably secure authenticated tree based key agreement protocol ASTR (authenticated STR). The protocol is obtained by combining Paterson's digital signature scheme with STR key agreement protocol which is an unauthenticated protocol based Diffie-Hellman key agreement protocol. The security of ASTR can be reducible to 2-party decision Diffie-Hellman (DDH) problem.