Efficient authentication scheme for cross-trust domain of IoV based on double-layer shard blockchain

被引：0
|
作者：
Liu X. [1 ]
Zhong Q. [1 ]
Xia Y. [2 ]
机构：
[1] School of Information Science and Technology, Hangzhou Normal University, Hangzhou
[2] College of Computer Science and Technology, Zhejiang University, Hangzhou
来源：
Tongxin Xuebao/Journal on Communications | 2023年 / 44卷 / 05期
关键词：
batch authentication; cross-trust domain; efficient; Internet of vehicles; shard blockchain;
D O I：
10.11959/j.issn.1000-436x.2023080
中图分类号：
学科分类号：
摘要：
To solve the problems of poor scalability, slow synchronization of authentication information, and high authentication overhead in cross-trust domain message authentication in the Internet of vehicles (IoV), an efficient authentication scheme for cross-trust domain of IoV based on a double-layer shard blockchain was proposed. A double-layer shard blockchain architecture was designed for lots of cross-trust domain message authentication by constructing blockchains on different entity levels in all domains to improve the scalability of the system and ensure secure and efficient sharing of cross-domain information. A blockchain sharding method based on the Metis graph partitioning algorithm for IoV was proposed to balance loads of each shard and adapt to the uneven distribution of authentication information on different road segments in IoV, thereby improving the efficiency of synchronizing a large number of authentication information on the chain. A batch authentication scheme based on certificateless public-key cryptography (CL-PKC) was proposed, which reduced the authentication overhead of cross-domain messages by enabling batch authentication of messages from different trust domains. Experimental results show that the proposed scheme effectively improves the authentication efficiency of cross-trust domain messages. Compared with other schemes, the proposed scheme reduces the computational overhead of a large number of cross-domain message authentication by more than 26.4%. © 2023 Editorial Board of Journal on Communications. All rights reserved.
引用
收藏
页码：213 / 223
页数：10
相关论文
共 27 条
  • [1] TAN H W, XUAN S C, CHUNG I., HCDA: efficient pairing-free homographic key management for dynamic cross-domain authentication in VANETs, Symmetry, 12, 6, (2020)
  • [2] AGGARWAL S, KUMAR N, GOPE P., An efficient blockchain-based authentication scheme for energy-trading in V2G networks, IEEE Transactions on Industrial Informatics, 17, 10, pp. 6971-6980, (2021)
  • [3] ALI I, CHEN Y, ULLAH N, Et al., An efficient and provably secure ECC-based conditional privacy-preserving authentication for vehicle-to-vehicle communication in VANETs, IEEE Transactions on Vehicular Technology, 70, 2, pp. 1278-1291, (2021)
  • [4] WANG P, LIU Y N., SEMA: secure and efficient message authentication protocol for VANETs, IEEE Systems Journal, 15, 1, pp. 846-855, (2021)
  • [5] CHEN J, ZHAN Z Y, HE K, Et al., XAuth: efficient privacy-preserving cross-domain authentication, IEEE Transactions on Dependable and Secure Computing, 19, 5, pp. 3301-3311, (2022)
  • [6] LIN C, HUANG X Y, HE D B., EBCPA: efficient blockchain-based conditional privacy-preserving authentication for VANETs, IEEE Transactions on Dependable and Secure Computing, 20, 3, pp. 1818-1832, (2022)
  • [7] FENG X, CUI K P, XIE Q Q, Et al., Distributed anonymous authentication scheme based on blockchain in VANET, Journal on Communications, 43, 9, pp. 134-147, (2022)
  • [8] XUE L Y, HUANG H P, XIAO F, Et al., A cross-domain authentication scheme based on cooperative blockchains functioning with revocation for medical consortiums, IEEE Transactions on Network and Service Management, 19, 3, pp. 2409-2420, (2022)
  • [9] WANG J, WANG H., Monoxide: scale out blockchains with asynchronous consensus zones, Proceedings of the 16th USENIX symposium on networked systems design and implementation, pp. 95-112, (2019)
  • [10] HUANG H W, PENG X W, ZHAN J Z, Et al., BrokerChain: a cross-shard blockchain protocol for account/balance-based state sharding, Proceedings of IEEE Conference on Computer Communications, pp. 1968-1977, (2022)
123