政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/128989

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/128989

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113648/144635 (79%)
造訪人次 : 51652381 線上人數 : 565

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系碩士在職專班 > 學位論文 > Item 140.119/128989

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/128989

題名:	使用恆星共識協議於車載隨意行動網路以確保訊息傳遞的安全性 Using Stellar Consensus Protocol in VANETs to Ensure the Security of Message Transmission
作者:	張哲維 Chang, Che-Wei
貢獻者:	張宏慶 Jang, Hung-Chin 張哲維 Chang, Che-Wei
關鍵詞:	恆星共識協議聯合拜占庭協議系統車載隨意行動網路資訊安全 Stellar Consensus Protocol (SCP) Federated Byzantine Agreement System Vehicular Ad-hoc Network (VANET) Information Security
日期:	2020
上傳時間:	2020-03-02 11:37:34 (UTC+8)
摘要:	在車載隨意行動網路中，常透過車與車以及車與路邊基地台(Road Side Unit，RSU) 之間的訊息傳遞，來及時更新路況訊息以達到車輛之間的安全控管；或是在有緊急事件發生時，能傳送緊急訊息請求救援，把正確的路況資訊傳遞給其它車輛，讓其它車輛可以改道避免塞車或避免影響救援的狀況發生。然而，若遇到惡意攻擊者傳送不正確的訊息，或訊息更新速度較慢，反而可能會影響行車安全。例如在塞車或有事故的路段，卻得到順暢的訊息而沒有繞道，導致更塞，甚至影響救援，造成不必要的資源浪費。因此，確保訊息的安全性(safety)及活躍性(liveness)至為重要。恆星共識協定(Stellar Consensus Protocol，SCP)是一個是基於聯合拜占庭協議(Federated Byzantine Agreement)開發的共識協定。在原始的Byzantine Agreement中，參與投票的節點必須事先定義，但這並不符合在車載隨意行動網路中，車(節點)會動態移動及增減的狀況。SCP的優點是可動態選擇成員，至於如Bitcoin blockchain使用Proof of Work (PoW)的方式會消耗大量的能源與時間，無法符合車載網路中節點快速移動的需求。SCP可在短短幾秒內快速達成共識並輸出值，同時也基於Federated Byzantine Agreement的幾個特性和理論，可確保整個流程的安全性及活躍性。本研究方法將特定路段中的車輛及RSU視為節點，讓車可動態選擇自己附近的車做為slice，透過節點間訊息的交換加入其它節點的slice以組成一個quorum，再經由不同階段(phase)節點間訊息的傳遞讓不同節點達成共識，決定一個輸出值代表當下的路況。我們對RSU及車輛依據屬性分成不同階層(tier)，配合調整slice的數量以對其效能、安全性及活躍性做出評估，並結合車輛信譽系統以優化提名流程、同時也對車載網路常會遇到的訊息傳遞被障礙物擋住的狀況做出模擬。最後我們根據實驗的結果證明SCP在車載網路是可行且可確保訊息傳遞的安全。 Vehicular Ad-hoc Network (VANET) provides the message transmission and communication between vehicles and Road Side Unit (RSU) to achieve real-time information update and safety control. When an accident occurs, VANET can be used to send emergency messages to ask for rescue and share this information with others. According to this information, other drivers will detour to avoid the traffic or situations affecting rescue. However, if the message is forged or modified by an attacker, it may not only affect traffic safety but also waste additional resources. Therefore, it is crucial to ensure the security and liveness of the message transmission in VANET. The Stellar Consensus Protocol (SCP) is a consensus protocol developed based on the Federated Byzantine Agreement. SCP allows nodes to choose members dynamically. Unlike the Proof of Work (PoW) used in Bitcoin blockchain which may consume a lot of energy and time, the SCP algorithm can reach a consensus within a few seconds. Besides, based on the characteristics of the Federated Byzantine Agreement, SCP can ensure the safety and liveness of the entire process. In this research, vehicles and RSU are the participated nodes involved in the consensus. Vehicles and RSU can choose their own slice from the nearby nodes to form a quorum. Through multiple phases of SCP, nodes are able to reach a consensus and externalize a value which represents the real-time road information. We group the RSUs and vehicles into different tiers and combine the vehicle reputation system to optimize the nomination process. Finally, we evaluate the performance, safety and liveness from the experiments to conclude that SCP is feasible and is able to ensure the security of message transmission.
參考文獻:	[1] L.M.Bach,B.Mihajevic and M.Zagar,“Comparative Analysis of Blockchain Consensus Algorithms”, 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), Opatija, Croatia, 21-25 May 2018. [2] Shanzhi Chen, Jinling Hu, Yan Shi, Ying Peng, Jiayi Fang, Rui Zhao and Li Zhao,“Vehicle-to-Everything (v2x) Services Supported by LTE-based Systems and 5G”, IEEE Communications Standards Magazine, pp.70-76, 26 July 2017. [3] T.Dasu, Y.Kanza and D.Srivastava,“Unchain Your Blockchain”, Symposium on Foundations and Applications of Blockchain, University of Southern California Los Angeles, California, pp.16-23, 9 March 2018. [4] Stefano De Angelis, Leonardo Aniello, Roberto Baldoni, Federico Lombardi, Andrea Margheri and Vladimiro Sassone,“PBFT vs Proof-of-Authority: Applying the CAP Theorem to Permissioned Blockchain”, Italian Conference on Cyber Security, January 2017. [5] Michael J.Fischer, Nancy A. Lynch and Michael S. Paterson,“Impossibility of Distributed Consensus with One Faulty Process”, Journal of the ACM (JACM), April 1985. [6] Bob Glickstein,“Understand the Stellar Consensus Protocol”, retrieved March 13 2019, [Online]. Available: https://medium.com/interstellar/understanding-the-stellar-consensus-protocol-423409aad32e. [7] Bob Glickstein,“Standalone Implementation of the Stellar Consensus Protocol.”, retrieved April 20 2018, [Online]. Available: https://github.com/bobg/scp/. [8] Samson Hoi, "區塊鏈 Blockchain-IPFS 分散式檔案系統", retrieved Nov 14 2018, [Online]. Available: https://www.samsonhoi.com/689/blockchain-ipfs-intro. [9] Johannes Innerbichler and Violeta Damjanovic-Behrendt,“Federated Byzantine Agreement to Ensure Trustworthiness of Digital Manufacturing Platforms”, CryBlock`18 Proceedings of the 1st Workshop on Cryptocurrencies and Blockchains for Distributed Systems, Munich, Germany, pp.111-116, 15 June 2018. [10] John B.Kenney, 2011,“Dedicated Short-range Communications (DSRC) Standards in the United States”, Proceedings of the IEEE, 99(7), pp.1162-1182, 16 June 2011. [11] C.A.Kerrache, C.T.Calafate, J.C.Cano, N.Lagraa and P.Manzoni, "Trust Management for Vehicular Networks: An Adversary-oriented Overview," IEEE Access, vol. 4, pp.9293-9307, December 2016. [12] Sunny King and Scott Nadal, “PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake.”, retrieved August 2012, [Online]. Available: https://peercoin.net/assets/paper/peercoin-paper.pdf. [13] Georgios Konstantopoulos, “Understanding Blockchain Fundamentals, Part 1: Byzantine Fault Tolerance”, retrieved 1 Dec 2017, [Online]. Available: https://medium.com/loom-network/understanding-blockchain-fundamentals-part-1-byzantine-fault-tolerance-245f46fe8419. [14] L.Lamport, R.Shostak and M.Pease, “The Byzantine Generals Problem”, ACM Transactions on Programming Languages and Systems, Vol.4, No.3, July 1982. [15] Leslie Lamport,“Paxos Made Simple”, ACM SIGACT News (Distributed Computing Column) 32, 4, pp.51-58, Dec 2001. [16] Zhaojun Lu, Qian Wang, Gang Qu and Zhenglin Liu,“BARS: a Blockchain-based Anonymous Reputation System for Trust Management in VANETs”, 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE), New York,NY, USA, 1-3 Aug 2018. [17] Nisha Malik, Priyadarsi Nanda, Xiangjian He and Ren Ping Liu,“Trust and Reputation in Vehicular Networks: A Smart Contract-based Approach”, 2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE), Rotorua, New Zealand, New Zealand, 5-8 August 2019. [18] David Mazières,“The Stellar Consensus Protocol: A Federated Model for Internet-level Consensus”, Stellar Development Foundation, 25 February 2016. [19] David Mazières,“The Stellar Consensus Protocol (SCP)”, retrieved 4 November 2018. [Online]. Available: https://tools.ietf.org/id/draft-mazieres-dinrg-scp-05.html. [20] Satoshi Nakamoto, “Bitcoin: A Peer-to-peer Electronic Cash System.”, retrieved October 2008, [Online]. Available: http://bitcoin.org/bitcoin.pdf. [21] Jonathan Petit and Zoubir Mammeri,“Dynamic Consensus for Secured Vehicular Ad hoc Networks”, 2011 IEEE 7th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 10-12 Oct 2011. [22] Fengzhong Qu, Zhihui Wu, Fei-Yue Wang and Woong Cho, “A Security and Privacy Review of VANETs”, published in: IEEE Transactions on Intelligent Transportation Systems, pp.2985–2996, 17 June 2015. [23] Henry Robinson, “A Brief Tour of FLP Impossibility”, retrieved August 13 2008, [Online]. Available: https://www.the-paper-trail.org/post/2008-08-13-a-brief-tour-of-flp-impossibility/. [24] Rakesh Shrestha, Rojeena Bajracharya and Seung Yeob Nam, “Blockchain-based Message Dissemination in VANETs”, 2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS), 25-27 October 2018. [25] Chea Sowattana, Wantanee Viriyasitavat and Assadarat Khurat,“Distributed Consensus-based Sybil Nodes Detection in VANETs”,2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE), 12-14 July 2017. [26] XiaoDong Zhang, Ru Li and Bo Cui,“A Security Architecture of VANET based on Blockchain and Mobile Edge Computing”, 2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN), 15-17 August 2018.
描述:	碩士國立政治大學資訊科學系碩士在職專班 101971013
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0101971013
資料類型:	thesis
DOI:	10.6814/NCCU202000158
顯示於類別:	[資訊科學系碩士在職專班] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
101301.pdf	5226Kb	Adobe PDF2	0	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋