|
| | | | |
| | | |
| Stat |
Members: 3651
Articles: 2'544'600
Articles rated: 2609
21 June 2024 |
|
| | | | |
|
Article overview
| |
|
|
Asymptotically Optimal Tree-based Group Key Management Schemes | | Hideyuki Sakai
; Hirosuke Yamamoto
; | | Date: |
1 Jul 2005 | | Subject: | Information Theory; Cryptography and Security ACM-class: E.4; H.1.1 | cs.IT cs.CR | | Abstract: | 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. | | Source: | arXiv, cs.IT/0507001 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
REGISTER