Asymptotically Optimal Tree-based Group Key Management Schemes
| dc.creator | Sakai, Hideyuki | |
| dc.creator | Yamamoto, Hirosuke | |
| dc.date | 2005-07-01 | |
| dc.date.accessioned | 2026-07-07T08:17:48Z | |
| dc.date.available | 2026-07-07T08:17:48Z | |
| dc.description | In key management schemes that realize secure multicast communications encrypted by group keys on a public network, tree structures are often used to update the group keys efficiently. Selcuk and Sidhu have proposed an efficient scheme which updates dynamically the tree structures based on the withdrawal probabilities of members. In this paper, it is shown that Selcuk-Sidhu scheme is asymptotically optimal for the cost of withdrawal. Furthermore, a new key management scheme, which takes account of key update costs of joining in addition to withdrawal, is proposed. It is proved that the proposed scheme is also asymptotically optimal, and it is shown by simulation that it can attain good performance for nonasymptotic cases. | |
| dc.description | 15 pages including 1 figure and 2 tables, submitted to the IEEE Transactions on Information Theory | |
| dc.identifier | https://arxiv.org/abs/cs/0507001 | |
| dc.identifier | http://arxiv.org/abs/cs/0507001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134220 | |
| dc.subject | Information Theory | |
| dc.subject | Cryptography and Security | |
| dc.subject | E.4; H.1.1 | |
| dc.title | Asymptotically Optimal Tree-based Group Key Management Schemes | |
| dc.type | text |