論文使用權限 Thesis access permission:校內校外均不公開 not available
開放時間 Available:
校內 Campus:永不公開 not available
校外 Off-campus:永不公開 not available
論文名稱 Title |
以路側單元為主之汽車網路安全協定 A RSU-Based Message Authentication Scheme in Vehicular Networks |
||
系所名稱 Department |
|||
畢業學年期 Year, semester |
語文別 Language |
||
學位類別 Degree |
頁數 Number of pages |
52 |
|
研究生 Author |
|||
指導教授 Advisor |
|||
召集委員 Convenor |
|||
口試委員 Advisory Committee |
|||
口試日期 Date of Exam |
2009-06-18 |
繳交日期 Date of Submission |
2009-07-15 |
關鍵字 Keywords |
認證、安全 RSU, Authentication, Security, VANET |
||
統計 Statistics |
本論文已被瀏覽 5668 次,被下載 0 次 The thesis/dissertation has been browsed 5668 times, has been downloaded 0 times. |
中文摘要 |
近年來,車輛網路慢慢的受到了重視。這是由於車輛網路有一些良好的應用,像是在車輛安全方面以及在一些服務應用上(電子地圖下載、上網服務等等)。前者應用所發出的訊息我們稱之為路況訊息,後者應用所發出的訊息則稱之為常務訊息。而這些訊息中,以路況訊息最為重要。在車輛行駛中,若發生了車輛意外或是路況擁塞等情況,這時透過了車輛網路的傳遞,把這些事件訊息即時廣播給其他車輛,使其提早獲得警訊,就可以避免其他的車輛捲入這場意外或讓路況不再更為擁塞。這樣的訊息是攸關生命安全的,因此,當傳播這些訊息的時候,要注意到的是這些訊息的正確性。也就是說,這些訊息是否會被不法份子給偽造、修改的情形,而造成交通的大亂,這是我們所不允許的。所以車輛網路的網路安全就受到了重視,這也是本論文的重點。 在對於車輛網路的訊息認證已經有許多的研究提出了一些方法,但這些方法有的使車輛計算負擔太重,有的有其不完整的缺點。而本論文則是整合了這些研究的方法,提出了改善了這些缺點的方法。第一個方法是在有路側單元的情況下,路用路側單元的協助來進行訊息認證。第二個則是針對無路側單元的情況下,利用群組的組成,以群為單位,每台車輛進行排程的輪流認證機制。這兩個方法都能在有效減少計算負擔的前提下,形成一個完善的訊息認證系統。 |
Abstract |
In the recent years, it comes into more notice for Vehicular Ad-hoc Network (VANET) due to good applications of VANET. For example, those applications include the driving secure and some serviced applications (e.g., loading electric maps, web Service, and so on). The delivered message about driving secure is called the traffic messages, and the delivered message about serviced applications is called the routine message. The traffic message is more important than the routine message. When vehicle is driven on the road and the events are happened (example of accident, or jam), it can broadcast these happened events to notify others on the same road by VANET and let others to earlier get the awareness to avoid the more serious accident or traffic jam. In fact, these traffic messages are related to the life of driver and passengers. Thus, we must pay attention to the correctness of these traffic messages when these messages are sent in VANET, i.e., it will result the serious traffic disorder if these messages are altered or forged by illegal offenders and we don’t permit this situation to occur. Hence, the network security in VANET is the emphasis in this paper. There are some studies that have proposed some scheme for message authentication in VANET. However, there still exist some imperfections in these schemes (for example, the communication overhead is too heavy). Thus, this thesis proposes two schemes to improve these drawbacks based on some schemes which had been proposed. The first proposed scheme verifies message with the RSU’s aid in the RSU scenario. The second proposed scheme uses the clustering to work a rotation for verifying message for no RSU scenario. The two schemes can efficiently reduce the communication overhead to form an integrity message authentication system. |
目次 Table of Contents |
中文摘要………………………………………………………………………………i Abstract………………………………………………………………………………..ii List of Figures………………………………………………………………………...iii Chapter 1 Introduction…………………………………………………………….1 1-1 Vehicular Ad-Hoc Network…………………………………………………..1 1-2 Motivation……………………………………………………………………3 1-3 Thesis Organization…………………………………………………………..5 Chapter 2 Related Works……………………………………………………….....6 2-1 RAISE Scheme……………………………………………………………….6 2-2 COMET……………………………………………………………………...10 2-3 TESLA One-way hash chain…………………………………………………13 2-4 DDVC………………………………………………………………………..15 Chapter 3 Proposed Schemes………………………………………………….....17 3-1 Proposed Scheme-1…………………………………………………………..17 3-1-1 Common Secret Key Establishment……………………………….....17 3-1-1-1 Case 1: Enter for the first time………………………………...17 3-1-1-2 Case 2: Enter for the second or more times…………………...20 3-1-2 Aggregated Hash……………………………………………………...21 3-1-3 Message Verification for Receivers…………………………………...22 3-1-4 Communication between Different RSUs……………………………24 3-1-4-1 Problem Statement…………………………………………….24 3-1-4-2 Solution………………………………………………………..25 3-1-5 Handoff Problem……………………………………………………...26 3-1-5-1 Problem Statement…………………………………………….26 3-1-5-2 Solution………………………………………………………...27 3-2 Proposed Scheme-2……………………………………………………….......29 3-2-1 First-Stage Clustering Scheme………………………………………...29 3-2-1-1 The DV Cost for Clustering……………………………………29 3-2-1-2 The DDVC algorithm………………………………………….30 3-2-2 Second-Stage Clustering Scheme……………………………………..32 3-2-3 Schedule Management & Cluster Maintenance……………………….35 3-2-3-1 Join……………………………………………………………..36 3-2-3-2 Leave…………………………………………………………...37 3-2-3-3 Overlap of clusters…………………………………………….38 3-2-3-4 Clusterhead is destroyed………………………………………38 3-2-4 Verification……………………………………………………………39 Chapter 4 Conclusion……………………………………………………………...41 Reference…………………………………………………………………………….42 |
參考文獻 References |
[1] U.S. Dept. Transp., Nat. Highway Traffic Safety Admin., Vehicle Safety Communications Project, 2006. [2] S. Lee, G. Pan, J. Park, M. Gerla, and S. Lu, “Secure incentives for commercial ad dissemination in vehicular networks,” in Proc. ACM Int Symp. MobiHoc, 2007, pp. 150–159. [3] X. Lin, X. Sun, X.Wang, C. Zhang, P.-H. Ho, and X. Shen, “TSVC: Timed efficient and secure vehicular communications with privacy preserving,” IEEE Trans. on Wireless Communication, vol. 7, Issue 12, pp. 4987-4998, Dec. 2008. [4] X. Lin, X. Sun, P.-H. Ho, and X. Shen, “GSIS: A secure and privacy preserving protocol for vehicular communications,” IEEE Trans. on Veh.Technol., vol. 56, no. 6, pp. 3442–3456, Nov. 2007. [5] C. Zhang, X. Lin, R. Lu, P.-H. Ho, X. Shen, “An Efficient Message Authentication scheme for Vehicular Communications,” IEEE Trans. on Veh. Technol., vol. 57, Issue 6, no. 6, pp. 357-3368, Nov. 2008. [6] C. Zhang, R. Lu, X. Lin, P.-H. Ho, X. Shen, “An Efficient Identity-based Batch Verification scheme for Vehicular Sensor Networks,” in Proc. IEEE INFOCOM, Phoenix, AZ, 2008, pp. 246 – 250, April 2008. [7] R. Lu, X. Lin, H. Zhu, P.-H. Ho, and X. Shen, “ECPP: Efficient conditional privacy preservation protocol for secure vehicular communications,” in Proc. IEEE INFOCOM, Phoenix, AZ, 2008, pp. 1229–1237. [8] Dedicated Short Range Communication (DSRC). [Online]. Available: http://grouper.ieee.org/groups/scc32/dsrc/index.html. [9] A. Perrig, R. Canetti, J. D. Tygar, and D. Song, “The TESLA broadcast authentication protocol,” RSA Crypto., vol. 5, no. 2, pp. 2–13, 2002. [10] Sakhaee, E., Jamalipour, A., “Stable Clustering and Communications in Pseudolinear Highly Mobile Ad Hoc Networks” IEEE Trans. on Veh. Technol., vol. 57, Issue 6, no. 6, pp. 3769-3777. [11] E. Sakhaee and A. Jamalipour, “Aerouter(TM)—A graphical simulation tool for routing in aeronautical systems,” in Proc. IEEE WCNC, New Orleans, LA, Mar. 2005, pp. 2506–2511. [12] D.R. Stingson, Cryptography: Theory and Practice, 3rd ed. Boca Raton, FL: CRC, 2005. |
電子全文 Fulltext |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。 論文使用權限 Thesis access permission:校內校外均不公開 not available 開放時間 Available: 校內 Campus:永不公開 not available 校外 Off-campus:永不公開 not available 您的 IP(校外) 位址是 3.17.150.163 論文開放下載的時間是 校外不公開 Your IP address is 3.17.150.163 This thesis will be available to you on Indicate off-campus access is not available. |
紙本論文 Printed copies |
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。 開放時間 available 已公開 available |
QR Code |