Security Analysis of Provably Secure Constant Round Dynamic Group Key Agreement(Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• Recently, Dutta and Barua proposed provably secure constant round authenticated group key agreement protocols in dynamic scenario. In this letter, we show that their Leave Protocol does not provide forward secrecy, that is, a leaving user can still obtain the new session key used in subsequent sessions.

• 社団法人電子情報通信学会の論文
• 2006-11-01

著者

• Teo Joseph

  School Of Electrical & Electronic Engineering Nanyang Technological University

• TAN Chik

  Department of Computer Science and Media Technology, Gjovik University College

• NG Jim

  School of Electrical & Electronic Engineering, Nanyang Technological University

• Ng Jim

  School Of Electrical & Electronic Engineering Nanyang Technological University

• Tan Chik

  Department Of Computer Science And Media Technology Gjovik University College

関連論文

• Authenticated Dynamic Group Key Agreement for Autoconfigurable Mobile Ad Hoc Networks(Network)
• Security Analysis of Provably Secure Constant Round Dynamic Group Key Agreement(Information Security)
• A Computationally Efficient Energy-Aware Multicast Tree Recovery Algorithm for Ad Hoc Network(Network)

スポンサーリンク