为节约存储空间和整体处理时间,首先基于KOR提出一种新的密钥更新策略和协议(KOR^+),并与KOR作了比较。其次,在密钥树是满和平衡的条件下,对采用KOR^+及UOR策略的密钥服务器分别建立平均加密代价公式。最后,用解析方法导出它们的最优密钥树度数。
Based on KOR a new rekeying strategy and protocol( called KOR^+ ) are first proposed and compared with KOR in this paper, Then two formulae of the average encryption costs of a key server utilizing KOR^+ and UOR are established respectively provided that the key trees are full and balanced. Finally, optimal key tree degrees are deduced analytically for both of them.