(In)security of efficient tree-based group key agreement using bilinear map

Phan, Raphael C.-W.; Goi, Bok-Min

map.pdf (304.12 kB)

(In)security of efficient tree-based group key agreement using bilinear map

conference contribution

posted on 2009-12-17, 12:17 authored by Raphael C.-W. Phan, Bok-Min Goi

A group key agreement protocol enables three or more parties to agree on a secret group key to allow for communication of secret messages between them. In this paper, we consider the security of an efficiency-improved version of the tree-based group key agreement protocol using bilinear maps proposed by Lee et al., and claimed to reduce computational costs while preserving security. To be precise, we show several attacks on this protocol and discuss how they could have been avoided.

History

School

Mechanical, Electrical and Manufacturing Engineering

Citation

PHAN, R.C.-W., and GOI, B.-M., 2008. (In)security of efficient tree-based group key agreement using bilinear map. IN: IEEE/IFIP International Embedded and Ubiquitous Computing, (EUC '08), Shanghai, 17-20 Dec., vol. 2, pp. 443 - 446

Publisher

Version

VoR (Version of Record)

Publication date

2008

Notes

This is a conference paper [© IEEE]. It is also available at: http://ieeexplore.ieee.org/ Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.