arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0507001cs.ITcs.CRmath.IT
收藏

渐近最优的基于树的组密钥管理方案

Asymptotically Optimal Tree-based Group Key Management Schemes

Hideyuki Sakai, Hirosuke Yamamoto

摘要:

在公共网络上实现组密钥加密的安全多播通信的密钥管理方案中,通常使用树结构来有效地更新组密钥。Selcuk和Sidhu提出了一种基于成员退出概率动态更新树结构的方案。本文证明了Selcuk-Sidhu格式对于撤退费用是渐近最优的。此外,提出了一种新的密钥管理方案,该方案考虑了加入和退出的密钥更新代价。证明了所提出的方案也是渐近最优的,并通过仿真表明,它可以获得良好的性能的非渐近情况。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑