【摘要】：組播是一種區(qū)別于單播的通信技術(shù),它采用“一對多”的通信方式,現(xiàn)實(shí)生活中,許多新型應(yīng)用如視頻點(diǎn)播、遠(yuǎn)程教學(xué)和網(wǎng)絡(luò)會(huì)議等都使用了組播通信技術(shù)。組播通信技術(shù)的日益發(fā)展,就使得組播的安全性問題顯得更加突出,其中組播密鑰管理就是其中需要重點(diǎn)關(guān)注的問題之一。但是,目前針對組播密鑰管理方案的研究主要集中在如何降低密鑰存儲(chǔ)量和提高加密及解密的效率問題上,而忽略了組播通信技術(shù)中的固有屬性。確切地說,這些研究的重點(diǎn)為組播組中的發(fā)送方提供了必要的安全需求,卻忽視了組播組中接收人員的隱私問題。經(jīng)典LKH協(xié)議實(shí)現(xiàn)中,動(dòng)態(tài)變化成員的身份信息是直接以明文形式存在于密鑰更新信息中的,假設(shè)竊聽者獲取到該密鑰更新信息,雖然他不能夠獲取到任何有效的數(shù)據(jù),但是卻可以輕而易舉地獲取到成員身份信息。這就會(huì)導(dǎo)致成員隱私泄露。本文就當(dāng)前已有的解決方案進(jìn)行研究,特別是LKH協(xié)議,并且分析它的優(yōu)缺點(diǎn)。然后針對成員隱私泄露的問題,在LKH協(xié)議上進(jìn)行相關(guān)改進(jìn)。設(shè)計(jì)一種具有用戶匿名性的組密鑰分發(fā)協(xié)議。首先,在LKH協(xié)議的實(shí)現(xiàn)中,設(shè)計(jì)一種提高組播組中成員解密效率的編號(hào)形式。這種編號(hào)形式借鑒了類似哈夫曼編碼的思想,為密鑰二叉樹中的每個(gè)樹節(jié)點(diǎn)進(jìn)行編號(hào),這樣就可以提高密鑰更新時(shí)的效率。其次,針對成員隱私泄露問題,設(shè)計(jì)索引匹配算法,該算法中通過偽隨機(jī)函數(shù)的計(jì)算,將經(jīng)典LKH協(xié)議中明文出現(xiàn)的成員身份信息進(jìn)行“隱藏”,是改進(jìn)后的協(xié)議具有用戶匿名性,避免成員隱私外泄的問題發(fā)生。最后,將改進(jìn)的協(xié)議進(jìn)行實(shí)現(xiàn),并且分析其相關(guān)計(jì)算開銷和存儲(chǔ)開銷等問題,驗(yàn)證其可行性。通過這些使該改進(jìn)后的協(xié)議能夠滿足實(shí)際生活中的應(yīng)用,利于組播通信技術(shù)的推廣使用。
[Abstract]:Multicast is a kind of communication technology which is different from unicast. It adopts "one-to-many" communication mode. In real life, many new applications such as VOD, distance learning and network conference use multicast communication technology. With the development of multicast communication technology, the security of multicast becomes more and more prominent, among which the key management of multicast is one of the most important issues. However, the current research on multicast key management mainly focuses on how to reduce the amount of key storage and improve the efficiency of encryption and decryption, while ignoring the inherent attributes of multicast communication technology. To be exact, these researches focus on providing the necessary security requirements for the sender in the multicast group, but ignoring the privacy of the receiver in the multicast group. In the classical LKH protocol implementation, the identity information of the dynamic member exists directly in the key update information in clear text. Suppose the eavesdropper gets the key update information, although he cannot obtain any valid data, However, membership information can be easily obtained. This can lead to member privacy disclosure. This paper studies the existing solutions, especially the LKH protocol, and analyzes its advantages and disadvantages. Then the LKH protocol is improved to solve the problem of member privacy disclosure. A group key distribution protocol with user anonymity is designed. Firstly, in the implementation of LKH protocol, a numbering scheme is designed to improve the decryption efficiency of multicast group members. This numbering form draws lessons from the idea of Huffman coding and numbers every tree node in the key binary tree so as to improve the efficiency of key updating. Secondly, aiming at the problem of member privacy disclosure, an index matching algorithm is designed. In this algorithm, the membership information in the classical LKH protocol is "hidden" by the calculation of pseudorandom function. The improved protocol has user anonymity and avoids the problem of member privacy leakage. Finally, the improved protocol is implemented, and its computational overhead and storage overhead are analyzed to verify its feasibility. Through these, the improved protocol can meet the practical application, which is conducive to the popularization and use of multicast communication technology.
【學(xué)位授予單位】：云南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TN918.4
，

本文編號(hào)：2250242