A new authenticated group key agreement in a mobile environment

作者：Lee Cheng Chi; Lin Tsung Hung; Tsai Chwei Shyong^*

来源：Annales des Telecommunications, 2009, 64(11-12): 735-744.

DOI：10.1007/s12243-009-0096-z

• Group key agreement
• Provable security
• Bilinear pairings
• Bilinear discrete logarithm problem
• Bilinear computational Diffie-Hellman problem
• Wireless network

A group key agreement protocol enables a group of communicating parties over an untrusted, open network to come up with a common secret key. It is designed to achieve secure group communication, which is an important research issue for mobile communication. In 2007, Tseng proposed a new group key agreement protocol to achieve secure group communication for a mobile environment. Its security is based on the decisional Diffie-Hellman assumption. It remedies the security weakness of the protocol of Nam et al. in which participants cannot confirm that their contributions were actually involved in the group key. Unfortunately, Tseng's protocol is a nonauthenticated protocol that cannot ensure the validity of the transmitted messages. In this paper, the authors shall propose a new authenticated group key agreement to remedy it. It is based on bilinear pairings. We shall prove the security of the proposed protocol under the bilinear computational Diffie-Hellman assumption. It is also proven to a contributory group key agreement protocol.

• 出版日期2009-12