Presentation 2003/3/19
Performance analysis for tree-based group key management schemes
Hideyuki SAKAI, Hirosuke YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is known that tree structures are useful in the key management schemes, which realize secure multicast communications encrypted by group keys on a public network. Selcku and Sidhu have proposed an efficient scheme by introducing the probabilities that members will leave a goup. In this report, the asymptotic tight bound of the key update cost is derived for Selcuk-Sidhu scheme. Furthermore, a new key management scheme is proposed and analyzed, which takes account of key update costs of joining addition to leaving.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Multicast communication / Key management schemes / Selcuk-Sidhu scheme
Paper # IT2002-61,ISEC2002-119,SST2002-167,ITS2002-144
Date of Issue

Conference Information
Committee ISEC
Conference Date 2003/3/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Performance analysis for tree-based group key management schemes
Sub Title (in English)
Keyword(1) Multicast communication
Keyword(2) Key management schemes
Keyword(3) Selcuk-Sidhu scheme
1st Author's Name Hideyuki SAKAI
1st Author's Affiliation Graduate School of Information Science and Technology, The University of Tokyo()
2nd Author's Name Hirosuke YAMAMOTO
2nd Author's Affiliation Graduate School of Information Science and Technology, The University of Tokyo
Date 2003/3/19
Paper # IT2002-61,ISEC2002-119,SST2002-167,ITS2002-144
Volume (vol) vol.102
Number (no) 743
Page pp.pp.-
#Pages 6
Date of Issue