Balanced batch LKH: new proposal, implementation and performance evaluation

Balanced batch LKH: new proposal, implementation and performance evaluation
复制标题

DOI:
10.1109/iscc.2003.1214218
复制
发表时间:
2003-09
期刊:
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003
影响因子:
--
通讯作者:
Josep Pegueroles;Francisco Rico-Novella
Josep Pegueroles;Francisco Rico-Novella
中科院分区:
其他
文献类型:
--
作者:
Josep Pegueroles;Francisco Rico-Novella

文献摘要

被引文献

相似文献

在组播组中,只有在每次成员加入或离开组时使用不同的密钥对发送到组的数据进行加密,才能实现完美的保密性。密钥服务器必须将新密钥发送给所有剩余成员,从而出现带宽效率问题。逻辑密钥树算法减少了要发送的消息数量,但在许多情况下,每次更改成员身份后重新设置密钥是没有意义的。批量密钥更新算法就是为了解决这些问题而提出的。然而,这种方法需要始终保持逻辑密钥树的平衡,以实现最大的带宽效率。提出了一种新的组播批量密钥更新技术。该技术重新分配树节点,以便始终保持树的平衡。
Perfect secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A key server must send the new key to all the remaining members so bandwidth efficiency concerns appear. Logical key tree algorithms reduce the number of messages to be sent, but in many scenarios, rekeying after each membership change has no sense. Batch rekeying algorithms are proposed as a solution to these problems. However such methods need to maintain the logical key tree balanced all the time on order to achieve maximum bandwidth efficiency. This paper presents a new technique for multicast batch rekeying. This technique reallocates the tree nodes in order to keep the tree balanced all the time.