跳到主要內容

臺灣博碩士論文加值系統

(2600:1f28:365:80b0:2119:b261:d24c:ce10) 您好!臺灣時間:2025/01/21 07:56
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:陳嘉榮
研究生(外文):Ja-long Chen
論文名稱:在行動網路中一個有效率的群組鑰管理法
論文名稱(外文):An Efficient Key Management Scheme for Mobile Network
指導教授:古政元古政元引用關係
指導教授(外文):Cheng-Yuan Ku
學位類別:碩士
校院名稱:國立中正大學
系所名稱:資訊管理所暨醫療資訊管理所
學門:教育學門
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:英文
論文頁數:34
中文關鍵詞:群組通訊群組鑰管理存取控制多項式階層存取
外文關鍵詞:access control polynomialkey managementhierarchical access controlgroup communication
相關次數:
  • 被引用被引用:0
  • 點閱點閱:303
  • 評分評分:
  • 下載下載:5
  • 收藏至我的研究室書目清單書目收藏:0
隨著行動商務的日漸普及,我們發展了很多的應用程式,某部份的應用程式是設計來傳送電子資訊,例如新聞傳播、視訊會議。Multicast 是主要的傳送方式 ,當Multicast傳輸時,我們必須管理群組鑰,必要的時候我們會進行群組鑰的更新動作來保護我們的資訊內容,這個動作稱之為 re-keying 。然而,太多的 re-keying 動作將會耗費過多電腦的運算能力以及頻寬,因此如何減少 re-keying 次數已經成為一個很熱門的研究方向。在使用者轉換群組時網路上管理key的伺服器會使用Multi-group key管理方法來進行re-keying,利用這個方法來管理key可以省下很多re-keying次數,因為大部分的key 可以在使用者端自動產生,但是為了符合 forward security 和 backward security 這兩個安全需求,有些部驟一樣要採用傳統的re-keying方式,因此我們的目標是要設計一個管理key的機制,可以使re-keying次數最小化。過程中我們利用一個存取控制多項式來改善Multi-group key管理方法的管理過程,並且將我們所提出的存取控制多項式進行最佳化 , 以改善伺服器和使用者端處理的效率,最後我們比較Multi-group和我們提出的方法,我們發現我們提出的方法有比較卓越的效率和較少的re-keying次數。
With the m-commerce becomes more and more common and many applications have been developed. Some of them are designed for information content delivery, such as news push, teleconference. Multicast is the main delivery way. In the process of multicast, we need to manage the group key and do some re-keying actions to protect the information content. However, too many re-keying actions would cost lots of computing capability and network bandwidth, so how to decrease the re-keying times becomes a hot issue. When nodes switch among groups, the key server would update keys by adopting the Multi-group key management scheme. In the re-keying steps, some re-keying actions can be done automatically by nodes. But for the security requirements of forward and backward security, we still adopt the traditional re-keying actions in the service group of the leaving side.
Hence, we aim to design a key management scheme that can minimize re-keying times. In the process of distributing keys, our proposed key management scheme generates a polynomial string to replace traditional re-keying steps. Furthermore, in order to improve the performance of processing time at server and client, we optimize the process of picking keys when generating polynomial string. After comparing our proposed scheme ACP to Multi-group, we find it has not only fewer re-keying times but also better performance.
1. Introduction 5
1.1 Background 5
1.2 Motivation and Objective 7
2. Related Works 8
2.1 Logical Key Hierarchy Tree (LKH) 8
2.1.1 Joining and Leaving the Group 11
2.1.2 Switching Service Group 14
2.2 User’s Privileges and Resource Hierarchy 16
2.3 The Existing Group Key Management Schemes of LKH 17
2.4 Access Control Polynomial (ACP) 18
3. Proposed Hierarchical Key Management Scheme 20
3.1 Preliminaries 20
3.2 The Switch Action in LKH with Access Control Polynomial (ACP) 22
3.3 To Optimize the Access Control Polynomial 24
4. Performance Analysis and Comparison 25
4.1 Simulation Implementation 25
4.2 Rekey Overhead Analysis 27
4.3 Performance Comparison 29
5. Conclusion and Discussion 32
References 33
[1] G. Wang, J. Ouyang, H.H. Chen and M. Guo, Efficient group key management for multi-privileged groups, Computer Communications 30 (11–12) (2007), pp. 2497–2509.
[2] Y. Sun and K.R. Liu, Hierarchical group access control for secure multicast communications, IEEE/ACM Transactions on Networking 15 (6) (2007), pp. 1514–1526.
[3] Qiong Zhang, Yuke Wang, and Jason P. Jue, A key management scheme for hierarchical access control in group communication, International Journal of Network Security 7,(3) (2008), pp. 323-334
[4] Y. Sun and K.J.R. Liu, Scalable hierarchical access control in secure group communications, Proceedings of IEEE INFOCOM 2004 2 (2004), pp. 1296–1306.
[5] C.K. Wong, M. Gouda and S.S. Lam, Secure group communications using key graphs, IEEE/ACM Transactions on Networking 8 (1) (2000), pp. 16–30.
[6] Q. Zhang and Y. Wang, A centralized key management scheme for hierarchical access control, IEEE GLOBECOM’04 4 (2004), pp. 2067–2071.
[7] D.M. Wallner, E.J. Harder and R.C. Agee, Key management for multicast: issues and architectures, IETF Network Working Group, RFC 2627 (1999).
[8] Alireza Nemaney Pour, Kazuya Kumekawa, Toshihiko Kato, Shuichi Itoh: A hierarchical group key management scheme for secure multicast increasing efficiency of key distribution in leave operation. Computer Networks 51 (17) (2007): 4727-4743
[9] Xukai Zou, Yuan-Shun Dai_, Xiang Ran, Dual-Level key management for secure grid communication in dynamic and hierarchical groups, Future Generation Computer Systems 23 (2007) 776–786.
[10] S.G. Akl, P.D. Taylor, A cryptographic solution to the problem of access control in a hierarchy, ACM Transactions on Computer Systems (TOCS) 1 (3) (1983) 239–248.
[11] A. Sherman and D. McGrew, Key establishment in large dynamic groups using one-way function trees, Transactions on Software Engineering 29 (5) (2003), pp. 444–458.
[12] Marcel Waldvogel, Germano Caronni, Dan Sun, Nathalie Weiler, Bernhard Plattner, The versakey framework : versatile group key management, Journal on Selected Areas in Communications: Special Issue on Middleware, 17 (9) (1999), pp. 1614-1631.
[13] X. Zou, Y. Dai, and E. Bertino, A practical and flexible key management mechanism for trusted collaborative computing, INFOCOM 2008. The 27th Conference on Computer Communications.IEEE, (2008), pp. 538–546.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top