以單向函數樹為基礎的群體廣播技術之研究

在現今科技盛行的時代中，網路越來越為人們所依賴，也提供人們越來越多的功能，如電子郵件、傳送訊息、線上交談、電子郵件、進行影像傳輸、電子新聞等等。而在網路所提供的眾多服務項目中需要仰賴群播技術的服務也日漸增加，如線上會議、網路購物、數位電視等等。群播技術中最為學者們所致力研究的在於更換會議金鑰時的效率問題。過去曾有學者提出以階層式架構結合單向函數而形成單向函數樹的方法，此種方法可以有效降低在有成員加入或離開群體時更換會議金鑰的訊息量。然而此種方法無法抵擋共謀攻擊，因此本文以單向函數樹的方法為基礎，改善其對於共謀攻擊方面的弱點，以提供一更具安全性並兼顧效率的群播技術。

關鍵字

群播；單向函數樹；會議金鑰

並列摘要

Multicast is an efficient technique to communicate with specific members. Sherman and McGrew proposed a new scalable algorithm called one way function tree for establishing session key in large and dynamic group. The number of messages broadcasted after a member is added or evicted is about proportional to the logarithm of group size. However, the scheme is vulnerable to the collusion attack. We will analysis the possible collusion attack on the scheme proposed by Sherman and McGrew and improve the weakness to provide a more secure scheme in this paper.

並列關鍵字

Mutlicast ； One way function tree ； Session key

參考文獻

[1]I. Chang, R. Engel, D. Kandlur, D. Pendarakis and D. Saha, “Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques,” INFOCOM’99, 1999.

[2]R. Cnetti, J. Gary, G. Itkis, D. Micciancio, M. Naor and B. Pinks, “Multicast Security: A Taxonomy and Some Efficient Constructions,” IEEE INFOCOM ’99, 1999, pp. 708-716.

[3]S. M. Ghanem, H. A. Wahab, “A Simple XOR-Based Technique for Distributing Group Key in Secure Multicasting,” Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000, pp. 166-171.

[6]R. Molva and A. Pannetrat, “Scalable Multicast Security with Dynamic Recipient Groups,” ACM Transactions on Information and System Security, Vol. 3, 2000, pp. 136-160.

[7]A. Sherman and D. McGrew, “Key Establishment in Large Dynamic Groups Using One-Way Function Trees,” IEEE Transactions on Software Engineering, Vol. 29, No. 5, 2003, pp. 444-458.

國際替代計量

以單向函數樹為基礎的群體廣播技術之研究

全文下載

主題瀏覽