跳到主要內容

臺灣博碩士論文加值系統

(34.226.244.254) 您好!臺灣時間:2021/08/03 03:07
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:黃卉娟
研究生(外文):Hui-Chuan Huang
論文名稱:行動隨意網路資料傳輸安全之研究
論文名稱(外文):The Study on Secure Data Transmission for Mobile Ad Hoc Network
指導教授:朱延平朱延平引用關係楊朝成楊朝成引用關係
指導教授(外文):Yen-Ping ChuChou-Chen Yang
學位類別:碩士
校院名稱:東海大學
系所名稱:資訊工程與科學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:中文
論文頁數:45
中文關鍵詞:隨意網路封包修改攻擊假冒封包攻擊拒絕服務攻擊身份為基礎的身份碼密碼系統橢圓曲線密碼系統共謀攻擊
外文關鍵詞:ad hoc networksmodification attackspacket forgery attacksdenial of service attackshash chainsidentity-basedelliptic curvecollision attack
相關次數:
  • 被引用被引用:0
  • 點閱點閱:626
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在行動運算環境中,隨意網路(Ad Hoc Networks)屬於一塊新興領域。隨意網路中,不需建立網路骨幹,例如:交換器、路由器或是基地台等。行動隨意網路上的行動節點想要相互通訊時,在網路中的每個行動節點必須扮演著像路由器的角色,來為這些行動節點找出彼此溝通的路徑。隨意網路有許多特殊的特性:動態網路拓撲、有限頻寬、行動節點的資源有限、有限的實體安全、多重跳躍(Multi-Hop Routing)、以及資源限制等等。由於隨意網路有以上這些特性,因此也容易遭受到許多安全上的威脅,例如:封包修改攻擊(Modification Attack)、假冒封包攻擊(Packet Forgery Attack)、拒絕服務攻擊(Denial of Service Attack)等等。若有些惡意節點濫用這些封包攻擊方式,會對整個網路造成相當大的威脅,導致網路功能無法運作。
在隨意網路中有二項重要的安全重點:第一項安全重點為保護傳送資料的安全,而另一個安全重點為安全的繞路環境。因此,在本研究論文中,我們相繼提出了兩個兼具安全與有效率的方法,結合身份為基礎的身份碼密碼系統(Identity-based Cryptosystem)、橢圓曲線密碼系統(Elliptic Curve Cryptosystem, ECC)以保護行動節點在隨意網路中繞路的安全以及當節點與節點之間通訊時傳送資料的安全。透過整合安全性繞路與金鑰協議,解決繞路及金鑰協議的安全問題,來達到資料在隨意網路上的傳輸安全。並且,在我們所提出的方法中也將有效的預防目前在隨意網路中較為新穎的共謀攻擊(Collision attack)及偽裝目的地節點攻擊。
Ad hoc networks, in which established infrastructure such as switches, routers and base stations or centralized administration are unnecessary, are an important emerging area of mobile computing. Each mobile node in these networks acts as a router and is responsible for cooperatively determining the path of other nodes to a particular destination. A number of other special characteristics of ad hoc networks are noteworthy: dynamic topology, limited bandwidth, mobile nodes resources limiting, limited physical security, multi-hop routing, energy restriction, etc. These characteristics of ad hoc networks, however, can make it easier for certain threats, such as packet modification attacks, packet forgery attacks and denial of service attacks, to succeed. The mishandling of these basic attacks may easily bring about further threats that can lead to the collapse of the network.
In general, there are two important security issues in ad hoc networks: protecting the data transmission and making the routing protocol secure. In this thesis we therefore propose two secure and efficient schemes, founded on an identity-based cryptosystem, hash chains and an elliptic curve cryptosystem (ECC), to protect the routing security and data secrecy of mobile nodes’ communication over ad hoc networks. Additionally, our proposed scheme can prevent collision attack and attackers fabricating the destination node for the purposes of communicating with the source node.
LIST OF FIGURES V
LIST OF TABLES VI
Chapter 1 Introduction 1
1.1 Research Motivation 1
1.2 Thesis Organization 2
Chapter 2 Background 3
2.1 Mobile Ad Hoc Networks 3
2.1.1 Routing protocols for ad hoc networks 6
2.1.2 Secure routing problems in ad hoc networks 8
2.1.3 Attacks in ad hoc networks 9
2.2 Related Theories and Schemes 15
2.2.1 Identity-based Encryption (IBE) 15
2.2.2 Bilinear Pairings 16
2.2.3 One-Way Hash Function 17
2.2.4 Hash Chaining 18
Chapter 3 Secure Data Transmission Protocol for Wireless Ad Hoc Networks 20
3.1 Notations 20
3.2 Key Agreement 21
3.3 Secure Transmission 24
3.4 Security Analysis 25
Chapter 4 An identity-based secure data transmission scheme for ad hoc networks 28
4.1 Key Agreement 29
4.2 Secure Transmission 29
4.3 Security Analysis 32
4.4 Performance Analysis 34
Chapter 5 Conclusions and Future Works 38
5.1 Conclusions 38
5.2 Future Works 38
[1]A. K. Bayya, S. Gupte, Y. K. Shukla, and A. Garikapati, “Security in Ad Hoc Networks”, Computer Science Department University of Kentucky, available at http://www.cs.uky.edu/~singhal/term-papers/Fourth-paper.doc c
[2]R. Anderson, C. Manifavas, and C. Southerland, “NetCard-A Practical Electronic Cash System,” in Proceedings of the 4th Cambridge Workshop on Security Protocols. Cambridge: Springer-Verlag, 1996, pp. 49-57.
[3]A. Shamir, “How to Share a Secret,” Communications of the ACM, Vol. 22, 1979, pp. 612-613.
[4]A. Shamir, “Identity-based Cryptosystems and Signature Schemes,” in Proceedings of CRYPTO 84 on Advances in cryptology, LNCS 196, Springer-Verlag, 1984, pp. 47-53.
[5]C. C. Yang, T. Y. Chang, and M. S. Hwang, “A New Anonymous Conference Key Distribution System Based on the Elliptic Curve Discrete Logarithm Problem,” Computer Standards & Interfaces, Vol. 25, Issue 2, 2003, pp. 141-145.
[6]C. E. Perkins and E. M. Royer, “Ad-Hoc On-demand Distance Vector routing,” in Proceedings of 2nd IEEE Workshop Mobile Computer Systems and Applications, 1999, pp.90-100.
[7]C. E. Perkins, Ad Hoc Networking, 2000, Addison Wesley Professional
[8]C. E. Perkins, and P. P. Bhagwat “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” in Proceedings of ACM SIGCOMM’94, 1994, pp. 234-244.
[9]D. Boneh and M. Franklin, “Identity-Based Encryption from the Weil Pairing,” in Proceedings of CRYPTO 2001, LNCS 2139, Springer-Verlag, 2001, pp. 213-229.
[10]D. Boneh, B. Lynn, and H. Shacham, “Short Signatures from the Weil Pairing,” in Proceedings of Advances in Cryptology (ASIACRYPT 2001), 2001, pp. 514–532.
[11]D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” in Proceedings of Mobile Computing, 1996, pp. 153-181.
[12]D. Johnson and A. Menezes, “The Elliptic Curve Digital Signature Algorithm,” Technical Report CORR 99-34, Centre for Applied Cryptographic Research, University of Waterloo, August 1999, available at http://www.cacr.math.uwaterloo.ca/ techreports/1999/corr99-34.pdf
[13]E. M. Royer and C. K. Toh, “A Review of Current Routing Protocols for Ad-Hoc Networks,” IEEE Personal Communications, Vol. 6, 1999, pp. 46-55.
[14]F. Hess, “Efficient Identity based Signature Schemes Based on Pairings”, in Proceedings of 9th Workshop in Selected Areas in Cryptography–SAC 2002, LNCS, Springer-Verlag, 2002, pp. 310-324.
[15]F. Zhang and K. Kim, “ID-based Blind Signature and Ring Signature from Pairings,” in Proceedings of the seventh Australasian Conference on Information Security and Privacy(Asiacrpt2002), LNCS 2501, Springer-Verlag, 2002, pp. 533-547.
[16]F. Zhang and K. Kim, “Efficient ID-Based Blind Signature and Proxy Signature from Pairings, ” in Proceedings of the Eighth Australasian Conference on Information Security and Privacy (ACISP 2003), Springer-Verlag, 2003, pp.500
[17]G. Pei, M. Gerla, and T. W. Chen, “Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks,” in Proceedings of 2000 IEEE International Conference on Communications (ICC 2000), New Orleans, LA, June 2000.
[18]R. Gennaro and P. Rohatgi, “How to Sign Digital Streams” in Proceedings of the 17th Annual International Cryptology Conference, Lecture Notes In Computer Science, Vol. 1294, pp. 180-197.
[19]G. Tsudik, “Message Authentication with One-way Hash Functions,” in Proceedings of Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'92), Vol. 3, 1992, pp. 2055-2059.
[20]L. Harn. and H. Lin, “A Non-repudiation Metering Scheme,” IEEE Communication Letters, Vol. 5, No. 12, 2001, pp.486-487.
[21]I. B. Damgard, “A Design Principle for Hash Functions,” in Proceedings of the 9th Annual International Cryptology Conference, Lecture Notes In Computer Science, Vol. 435, 1989, pp. 416-427.
[22]J. Binkley and W. Trost, “Authenticated Ad Hoc Routing at the Link Layer for Mobile Systems,” Wireless Networks, Vol. 7, No. 2, 2001, pp. 139–145.
[23]J. C. Cha and J. H. Cheon, “An identity-based signature from gap Diffie-Hellman groups,” in Proceedings of Practice and Theory in Public Key Cryptography(PKC'2003), Lecture Notes on Computer Science 2567, Springer-Verlag, 2003, pp. 18-30.
[24]K.G.. Paterson, “ID-based Signatures from Pairings on Elliptic Curves,” Electronics Letters, Vol. 38, No. 18, 2002, pp.1025-1026.
[25]K. Shim, “Efficient One Round Tripartite Authenticated Key Agreement Protocol from Weil Pairing,” Electronics Letters, Vol. 38, No. 13, 2002, pp. 630–632.
[26]K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, and E. M. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” in Proceedings of 10th IEEE international conference, 12-15 November, 2002, pp.78 – 87.
[27]K. S. Ng and W. K. G. Seah, “Routing Security and Data Confidentiality for Mobile Ad Hoc Networks,” in Proceedings of Vehicular Technology Conference, 2003, Vol. 3, 22-25 April, 2003, pp.1821–1825.
[28]C.Y. Lin, and T.C. Wu, , “An Identity-based Ring Signature Scheme from Bilinear Pairings,” Cryptology ePrint Archive, report 2003/117, available at http://eprint.iacr.org/2003/117/
[29]L. Zhou and Z. J. Haas, “Securing Ad Hoc Networks,” IEEE Network Magazine, Vol. 13, No. 6, 1999, pp. 24-30.
[30]M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A Review of Routing Protocols for Mobile Ad Hoc Networks,” Ad Hoc Networks, Vol. 2, No. 1, 2004, pp. 1-22.
[31]M. G. Zapata and N. Asokan, “Securing Ad Hoc Routing Protocols,” in Proceedings of the ACM Workshop on Wireless Security (WiSE ’OZ), September 2002, pp. 1-10.
[32]N. Koblitz, “Elliptic Curve Cryptosystems,” Mathematics of Computation, 1987, pp. 203-209.
[33]N. Koblitz, A. Menezes, and S. A. Vanstone, “The State of Elliptic Curve Cryptography,” Designs, Codes and Cryptography, Vol. 19, 2000, pp.173-193.
[34]P. Papadimitratos and Z. J. Haas, “Securing the Internet Routing Infrastructure,” IEEE Communications Magazine, Vol. 10, No. 40, 2002, pp. 60-68.
[35]P. Yi, Z. Dai, Y. Zhong, and S. Zhang, “Resisting Flooding Attacks in Ad Hoc Networks,” in Proceedings of Coding and Computing 2005 (ITCC 2005) Vol. 2, Issue 4-6, 2005, pp. 657-662.
[36]R. C. Merkle, “A Digital Signature Based on a Conventional Encryption Function,” Advances in Cryptology, CRYPTO'89, Lecture Notes in Computer Science, Vol. 435, 1989, pp. 218-238.
[37]R. Merkle, “One-Way Hash Functions and DES,” Advances in Cryptology, CRYPTO'89, Lecture Note in Computer Science, Vol. 435, 1989, pp. 428-446.
[38]R. Rivest, “The MD4 Message Digest Algorithm,” in Proceedings of the Cryptology-CRYPTO'90, 1991, pp. 303-311.
[39]S. Capkun, L. Buttyán, and J. P. Hubaux, “Small Worlds in Security Systems: An Analysis of he PGP Certificate Graph.” in Proceedings of the 2002 Workshop on New Security Paradigms, 2002, pp. 28–35.
[40]N. P. Smart, “An Identity based Authenticated Key Agreement Protocol based on the Weil Pairing,” Electronics Letters, Vol. 38, 2002, pp. 630-632.
[41]S. W. Changchien, M. S. Hwang, and K. F. Hwang, “A Batch Verifying and Detecting Multiple RSA Digital Signatures,” in Proceedings of International Journal of Computational and Numerical Analysis and Applications, Vol. 2, No. 3, 2002, pp. 303-307.
[42]T. C. Wu and R. L. Su, “ID-based Group-Oriented Cryptosystem and Its Digital Signature Scheme,” Computer Communications, Vol. 20, No. 11, 1997, pp. 1019-1026.
[43]V. D. Park and M. S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” in Proceedings of the IEEE INFOCOM '97 Conference on Computer Communications, IEEE Computer Society Press, Kobe, Japan, 1997, pp. 1405-1413.
[44]V. Miller, “Use of Elliptic Curves in Cryptography”, in Proceedings of Cryptology-CRYPTO ‘85, LNCS 218, Springer-Verlag, 1986, pp. 417-426.
[45]W. B. Lee and C. C. Chang, “User Identification and Key Distribution maintaining Anonymity for Distributed Computer Network,” Comput. Syst. Sci. Eng., Vol. 15(4), 2000, pp. 211-214.
[46]X. Yi, “Efficient ID-based Key Agreement from Weil Pairing,” Electronics Letters, Vol. 39, No. 2, 2003, pp. 206–208.
[47]Y. C. Hu, A. Perrig, and D. B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” in Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking, September 2002, pp. 12-23.
[48]Y. C. Hu, A. Perrig, and D. B. Johnson, “Packet Leashes: A Defense Against Wormhole Attacks in Wireless Ad hoc Networks,” in Proceedings of 22nd Annual Joint Conference of IEEE Computer and Communications Societies (Infocom’03), April 2003.
[49]Y. C. Hu, A. Perrig, and D. B. Johnson, “Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols,” in Proceedings of the ACM Workshop on Wireless Security (WiSe), 2003, pp. 30-40.
[50]Y. C. Hu, A. Perrig, and D. B. Johnson, “Efficient Security Mechanisms for Routing Protocols,” in Proceedings of the Tenth Annual Network and Distributed System Security Symposium (NDSS 2003), February 2003, pp. 57-73.
[51]Y. R. Tsai and S. J. Wang, “Routing Security and Authentication Mechanism for Mobile Ad Hoc Networks,” Vehicular Technology Conference, Vol. 7, 2004, pp. 4716-4720.
[52]Z. J. Haas, “A New Routing Protocol for the Reconfigurable Wireless Networks,” in Proceedings of 6th IEEE International Conference on Universal Personal Communications (ICUPC’97), 1997, pp. 562-566.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top