結合 CP-ABE 與基於策略變色龍雜湊的安全可修改 區塊鏈共享停車方案;Secure and Redactable Blockchain for Shared Parking Space With CP-ABE and Policy-Based Chameleon Hash

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > Electronic Thesis & Dissertation > Item 987654321/98361

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/98361

Title:	結合 CP-ABE 與基於策略變色龍雜湊的安全可修改區塊鏈共享停車方案;Secure and Redactable Blockchain for Shared Parking Space With CP-ABE and Policy-Based Chameleon Hash
Authors:	楊智凱;Yang, Chih-Kai
Contributors:	資訊管理學系
Keywords:	區塊鏈;共享停車位;CP-ABE;雙色龍雜湊;基於策略的變色龍雜湊;Blockchain;Shared parking space;CP-ABE;Chameleon Hash;Policy-Based Chameleon Hash
Date:	2025-07-24
Issue Date:	2025-10-17 12:40:56 (UTC+8)
Publisher:	國立中央大學
Abstract:	近年來,隨著城市車輛急遽增加,尋找車位成為一大難題,研究指出約 30 % 的交通壅塞源自停車搜尋,平均耗時達 8.1 分鐘。共享停車雖具潛力,卻因區塊鏈不可竄改特性與 GDPR 被遺忘權的資料刪除需求衝突而受限。本研究提出一套結合密文策略屬性加密(CP-ABE)與策略型變色龍雜湊(PCH)的隱私保護共享停車平台。CP-ABE 僅向符合屬性策略的用戶廣播可用車位資訊,提升資源利用;PCH 則在保留審計痕跡的前提下,允許對鏈上記錄進行受控重寫,以符合法規。同時系統透過代幣獎勵機制,鼓勵車位擁有者釋出閒置車位,進一步提高整體效能。整體方案已完成各種不同的測試。在高峰需求模擬中,系統核心階段與修改階段延遲與現有方案相當,且額外支援資料刪改功能。於以太坊 Sepolia 測試網進行各個智能合約平均 Gas 消耗測試。並利用知名車載網路模擬器 SUMO 模擬不同車流情境,本方案在高交通負載情境下,平均改道次數比起隨機搜尋下降約 29%~45%。實驗結果證明,本方案在效能、安全性與 GDPR 合規之間取得良好平衡,不僅化解區塊鏈不可變性與資料刪除需求的矛盾,也為未來動態、可修正的去中心化應用奠定堅實基礎。;Parking searches account for roughly 30 % of urban congestion and cost drivers an average of 8.1 minutes. Shared parking platforms could ease this, but blockchain’s immutability conflicts with GDPR’s “right” to be forgotten. We propose a privacy-preserving system combining CP-ABE and PCH: CP-ABE grants space data only to drivers meeting at-tribute policies, while PCH allows controlled on-chain redaction with an audit trail. A token-based incentive encourages owners to share idle spots, enhancing utilization. Smart contract gas consumption is measured on Ethereum’s Sepolia testnet, and traffic scenarios are emulated using the SUMO network simulator. The core allocation and modification phases achieve delays similar to leading approaches, and under heavy traffic our platform cuts rerouting events by 29 %–45 % compared to random search. This balanced solution addresses efficiency, security, and compliance, resolving immutability versus data-deletion conflicts for dynamic, redactable decentralized applications.
Appears in Collections:	[Graduate Institute of Information Management] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	13	View/Open

社群 sharing

Loading...