臺灣博碩士論文加值系統

由於無線網路群播服務的特性，在不同時段群組成員人數的差異可能會很大，所以無線網路群播服務金鑰管理機制必須提供有效率的群組成員增加及縮減的方法，以減低系統進行Re-Keying作業時網路的負載，此外，方法設計上需儘量減低行動處理機本身在產生新KEK Keys的負荷，降低無線網路群播服務行動處理機的使用門檻，及增加行動處理機使用的時間。
先前的研究，以集合為單位來進行Re-Keying訊息的傳送曾在Boolean Function Minimization 及EBS文章中提出，前者以Binary -k-Cube為基礎，結合布林函數化簡的想法，提出整批(Batch)作業Re-Keying的機制；而EBS則多數在探討針對單一使用者之Re-Keying機制，雖然EBS進行Re-Keying所造成的網路負載要比Tree-based的方法少，但是EBS由於本身設計的限制，群組成員的縮減及擴增必需重新選定每人手上持有的KEK數量(即重新選定k與m值)及其值，運作上有其困難，且作者並無提出明確的解決方法，如果群組人數差異很大，會造成系統資源很大的浪費。
我們在本研究中則採用Binary-k-Cube的概念加以延伸，除了說明Binary-k-Cube用在非整批作業的Re-Keying方法外，也提出Binary-k-Cube機制如何讓系統縮減及擴增的方法。此外，我們也提出了XOR的運算方法，來取代之前所使用的One Way Hash運算，得出新的KEK Keys值，減低行動處理機的負荷。

The number of group members in a wireless multicast service may be varying widely over the operation time. Therefore, an efficient mechanism for adapting to the change in the group members must be in place for reducing wireless network overheads in a secure multicast key management scheme. Besides, the mechanism must consider mobile hosts capacity for reducing computing overhead in regenerating new KEK keys.
In both the Boolean Function Minimization and the EBS methods, KDC gives each member a set of KEK Keys from the key pool for securing group communication. Each KEK key forms a set, because the KEK key is the same in some group members. KDC can send Re-Keying messages that is based on each set. The Boolean Function Minimization approach focuses on batch Re-Keying system when many group members leave the communication group at the same time. It uses Binary-k-Cube concept along with the Boolean function minimization techniques. The EBS method addresses the common Re-Keying system that considers the case of having a single group member leave the communication group. But it has difficulty of adapting to the change of group size in EBS, even though EBS is better than Tree-based method on Re-Keying overhead in the network. So, EBS wastes system resources when the range of group size varies widely.
In this thesis, we extend the Binary-k-Cube technique to cope with non-batch Re-Keying Systems. We design a simple method to adjust the amount of KEK keys for each member when the group members are changed. Besides, we use the XOR technique to replace One Way Hash Functions to generate new KEK Keys for old group members so as to minimize the computational overheads.

摘要 IV
Abstract VI
誌 謝 VII
第一章 緒論 1
1-1. 背景 1
1-2. 論文目標 4
1-3. 論文架構 5
第二章 相關研究 6
第三章 系統模型 18
第四章 Binary-k-Cube群播服務金鑰管理機制 20
4-1. 基本想法 20
4-2. 群組成員加入 23
4-3. 群組成員擴增 24
4-4. 群組成員離開 25
4-5. 群組成員縮減 27
第五章 效能分析 32
第六章 成員共謀之探討 35
第七章 結論與未來展望 38
重要參考文獻 39

[1] Mohamed Eltoweissy, M. Hossain Heydari, Linda Morales and I. Hal Sudborough, “Combinatorial Optimization of Group Key Management,” Journal of Network and Systems Management, Vol. 12, No. 1, March 2004.
[2] Yan Sun, Wade Trappe, and K. J. Ray Liu, “A Scalable Multicast Key Management Scheme for Heterogeneous Wireless Networks,” IEEE/ACM TRANSACTIONS ON NETWORKING, Vol. 12, NO. 4, AUGUST 2004.
[3] SANDRO RAFAELI AND DAVID HUTCHISON, “A Survey of Key Management for Secure Group Communication,” ACM Computing Surveys, Vol. 35, No. 3, pp. 309–329, September 2003.
[4] Jyh-How Huang and Shivakant Mishra, “Support for Mobility and Fault Tolerance in Mykil,” Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN’04), 2004.
[5] Yacine Challal, Hatem Bettahar, Abdelmadjid Bouabdallah, “SAKM: A Scalable and Adaptive Key Management Approach for Multicast Communications,” ACM SIGCOMM Computer Communications Review , Vol 34, No. 2, April 2004.
[6] R. Canetti, J. Garay, G. Itkis, D. Miccianancio, M. Naor and B. Pinkas, “Multicast security: A taxonomy and some efficient constructions,” in Proc. IEEE INFOCOM, Vol. 2, pp. 708–716, March 1999.
[7] M. J. Moyer, J. R. Rao and P. Rohatgi, “A survey of security issues in multicast communications,” IEEE Network, Vol. 13, pp. 12–23, Nov.–Dec. 1999.
[8] W. Trappe, J. Song, R. Poovendran and K. J. R. Liu, “Key distribution for secure multimedia multicasts via data embedding,” in Proc. IEEE ICASSP, pp. 1449–1452, May 2001,.
[9] M. Waldvogel, G. Caronni, D. Sun, N. Weiler and B. Plattner, “The VersaKey framework: Versatile group key management,” IEEE J. Select. Areas Commun, Vol. 17, pp. 1614–1631, September 1999.
[10] A. Ballardie, “Scalable multicast key distribution,” RFC 1949, May 1996.
[11] S. Mitra, “Iolus: A framework for scalable secure multicasting,” Proceedings of ACM SIGCOMM ’97, pp. 277–288, 1997.
[12] D. M. Wallner, E. J. Harder and R. C. Agee, “Key management for multicast: Issues and architectures,” Informational RFC, draft-wallner-key-arch-00.txt, July 1997.
[13] H. Harney and C. Muckenhirn, “Group Key Management Protocol (GKMP) Specification”, RFC 2093, July 1997.
[14] H. Harney and E. Harder, “Group secure association key management protocol,” draft-harney-spartagsakmp-sec-000.txt, April 1997.
[15] R. Canetti and B. Pinkas, “A taxonomy of multicast security issues, “ Internet Draft, May 1998.
[16] DANILO BRUSCHI and EMILIA ROSTI, “Secure Multicast inWireless Networks of Mobile Hosts:Protocols and Issues,” Mobile Networks and Applications Vol7, pp. 503–511, 2002.
[17] Isabella Chang, Robert, Engel, Dilip Kandlur, Dimitnos Pendarakis and Debanjan Saha, “Key management for secure lnternet multicast using Boolean function minimization techniques,” Journal of Network and Systems Management, Vol. 12, No. 1, March 2004.