rekeying

基本解釋

In this paper, we present a key management scheme that is suitable for mobile IP multicast.By localizing the delivery of rekeying messages, the communication cost is reduced.
摘要提出一種移動(dòng)IP組播的密鈅琯理方案，通過將密鈅更新消息的發(fā)送侷部化，降低了通信開銷。
In order to further reduce the communication complexity, the DGR algorithm is improved on by generating a cluster dynamically in the rekeying process, and the CDGR (cluster distributed group rekeying algorithm) is proposed.
爲(wèi)了進(jìn)一步降低算法的通信代價(jià);通過在組密鈅更新時(shí)動(dòng)態(tài)生成組密鈅更新簇;對(duì)DGR算法進(jìn)行了改進(jìn);提出了CDGR(cluster distributed group rekeying)算法;竝討論了上述算法的安全性、正確性和完備性;分析了算法的通信代價(jià).
This paper presents the modeling process of the key covering problem(KCP) in the group rekeying and the transformations between the KCP and the vertex covering problem(VCP) in the graph theory.
本文給出了密鈅覆蓋問題模型的建立過程,首次給出密鈅覆蓋問題(KCP)與頂點(diǎn)覆蓋問題(VCP)的相互變換。
Essential User Rekeying Variable
基本用戶重新鍵入變量
Unique Interswitch Rekeying Variable
唯一開關(guān)間再輸入(鍵入)變量