跳到主要內容

臺灣博碩士論文加值系統

(34.204.169.230) 您好!臺灣時間:2024/02/21 23:20
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:高群翔
研究生(外文):Chiun-Shiang Gau
論文名稱:雙線性映射技術之大群組金鑰協議機制
論文名稱(外文):A Key Agreement For Large Group Using Bilinear Maps
指導教授:黃明祥黃明祥引用關係林姿均林姿均引用關係
指導教授(外文):Min-Shiang HwangTzu-Chun Lin
學位類別:碩士
校院名稱:逢甲大學
系所名稱:應用數學所
學門:數學及統計學門
學類:數學學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:英文
論文頁數:45
中文關鍵詞:二元樹群組雙線性映射三元樹橢圓曲線認證系統四元樹
外文關鍵詞:key agreementTree-based Groupmulticastelliptic curveBilinear MappingBilinear TreeTernary Treequad tree
相關次數:
  • 被引用被引用:0
  • 點閱點閱:546
  • 評分評分:
  • 下載下載:35
  • 收藏至我的研究室書目清單書目收藏:0
一個有效能的大量動態群組認證系統,為的就是應付其群組系統內之成員移動汰換率高時而設置的。避免在新成員加入或移出時,整個系統做過多的變更。
因此在建造時,就必需特別花一些巧思使其建構出來的認證系統同時兼備所謂的效能性與安全性。

在現有的實際應用上面,如有線電視收接戶、會員制的俱樂部或是一般常使用的會議金鑰等,也都是可使用的時機。以往的相關研究大多都是以在橢圓曲線上的二元樹群組
作為建構模組,再使用雙線性映射來製造出認證金鑰的關聯性,而此舉也確實減少了當系統成員異動時認證金鑰改變的數量。並由原本的二元樹枝鏈發展到三元樹更能有效縮短計算時間。

而在此篇論文中,筆者再將已發展的三元樹拓展到四元樹,讓效能更為提昇,同時又兼備其安全性。
A strong and efficiency key agreement for large and dynamic
multicast groups system is used to cope with the members of the
system with transfers very often. To avoid the situation of the
new members join or the old members leave without making too many
alterations, we must construct with the way efficiency and
security.
1.Introduction
2.Mathematic and Security Definitions
2-1 Basic Mathemaic Definition
2-2 Basic Cryptography Definition
3.Group Operation And Related Work
3-1 Group Membership Operation
3-2 Bilinear Key Tree Agreement
3-3 Ternary Key Tree Agreement
4.Our Protocol
4-1 System Setup
4-2 Join Protocol
4-3Leave Protocol
4-4 Security Analysis
5.Comparision
5-1 Computation Costs For Dynamic Operation
5-2 Compare total amount Of Keys And Blinded Keys
6.Conclusion
Bibliography
[1] S. Al-Riyami and K. Paterson,Authenticated three party key agreement protocols from pairings," Cryptology Print Archive, Report 2002/035, available at http://eprint.iacr.org/2002/035/.
[2] P.S.L.M. Barreto, H.Y. Kim, B.Lynn, and M.Scott,"Efficient Algorithms for pairing-based cryptosystems," To appear in Cryptology-Crypto''2002,available at http://eprint.iacr.org/2002/008/.
[3] R.Canetti and R.Rivest, "Pairing-Based Cryptography", Special Topics in Cryptograph, May 5,2004.
[4] D.S. Dummit, "Abstract Algebra", Prentice-Hall, Inc,1991.
[5] Diffie-Hellman, Key Agreement Method E. Rescorla June 1999.
[6] 鄧安文; 密碼學-加密演算法;全華科技圖書出版.2004.
[7] T.W. Hungerford, "Algebra", New York, 1974.
[8] N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol. 48, PP.203-209, 1987
[9] S. Lee, Y. Kim, K. Kim, and D.H. Ryu," An Efficient Tree-based Group Key Agreement using Bilinear Map",
[10] S. Mittra, "Iolus: a framework for scaclable secure multicasting," in Proceedings of ACM SIGCOMM''97, pp. 277-288, New York, 1997.
[11] J.Pieprzyk, T.Hardjono, and J.Seberry, "Fundamentals of Computer Security", Springer, 2003.
[12] L.M Wang and C.K Wu, "Efficient Key Agreement for Large and Dynamic Multicast Groups ", International Journal of Network Security,Vol.3, No.1, PP.8-17, July 2006
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top