OCHJRNChain: A Blockchain-Based Security Data Sharing Framework for Online Car-Hailing Journey

• Published in: IEEE transactions on intelligent transportation systems Vol. 25; no. 6; pp. 5299 - 5311
• Main Authors: Hong, Yujie, Yang, Liang, Xiong, Zehui, Kanhere, Salil S., Jiang, Hongbo
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Automobiles; Blockchain; Blockchains; Costs; Data privacy; data sharing; Industries; Information sharing; online car hailing; Privacy; privacy protection; Security; Verification
• ISSN: 1524-9050; 1558-0016
• DOI: 10.1109/TITS.2023.3331835

The location information of cars contains great value, but the uncontrollable characteristics of public data and the difficulty in distributing benefits derived from the potential value of the data greatly reduces the enthusiasm for data owners to share their data. In addition, the current selective disclosure schemes based on merkle tree still require large costs when there are many data items. To solve these problems, a blockchain-based framework for sharing cars' location information applicable to the online car hailing industry is proposed in this paper, enabling the sharing of cars' location information while protecting passengers' privacy through selective disclosure. The combination of homomorphic encryption and probabilistic verification enables a faster batch data verification compared to other blockchain-based data sharing schemes, as well as ensures the authenticity of the data uploaded to the blockchain. The experimental results show that the proposed selective disclosure mechanism based on hash exclusive or tree has lower costs than the baseline for cases with many data items. Moreover, the proposed framework meets both security and feasibility requirements. Specifically speaking, under the constraint of 128-bits security level, the costs of time and space on the location information during one drive are at microsecond level and kilobyte level, respectively. Finally, the scheme is suitable for scenarios with higher throughput.