RIC-SDA:基于声誉激励委员会的 VANET 安全条件双重认证方案

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ningbin Yang;Chunming Tang;Tianqi Zong;Zhikang Zeng;Zehui Xiong;Debiao He
{"title":"RIC-SDA:基于声誉激励委员会的 VANET 安全条件双重认证方案","authors":"Ningbin Yang;Chunming Tang;Tianqi Zong;Zhikang Zeng;Zehui Xiong;Debiao He","doi":"10.1109/TMC.2024.3442933","DOIUrl":null,"url":null,"abstract":"Vehicular ad hoc networks (VANETs) establish wireless connections among all vehicles, enabling seamless mobile communication. However, existing conditional privacy protection VANETs authentication schemes fail to address the issue of potential key-exposure and do not provide accelerated vehicle authentication. In this paper, we propose a reputation incentive committee-based secure conditional dual authentication scheme for VANETs called RIC-SDA. Our proposed scheme incorporates dual authentication of the consensus committee and vehicle-to-vehicle (V2V) communication. It enables the rapid provision of dynamic vehicle epoch-key from consensus committee authentication for V2V authentication through our designed reputation incentive mechanism. To mitigate the potential key-exposure problem, we introduce a novel concept of secure vehicle epoch communication, which means V2V authentication is valid for only one epoch blockchain unit time. The proposed scheme achieves lightweight computation and incurs minimal communication overheads, with the signature size being just 137 bytes. The RIC-SDA scheme supports fast batch verification. We prove that our proposed scheme is unforgeable security under random oracle and demonstrate its feasibility by implementing it in a test network based on Ethereum Sepolia. The results demonstrate that our RIC-SDA solution outperforms the existing state-of-the-art authentication VANET schemes regarding efficiency and communication costs.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":null,"pages":null},"PeriodicalIF":7.7000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs\",\"authors\":\"Ningbin Yang;Chunming Tang;Tianqi Zong;Zhikang Zeng;Zehui Xiong;Debiao He\",\"doi\":\"10.1109/TMC.2024.3442933\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular ad hoc networks (VANETs) establish wireless connections among all vehicles, enabling seamless mobile communication. However, existing conditional privacy protection VANETs authentication schemes fail to address the issue of potential key-exposure and do not provide accelerated vehicle authentication. In this paper, we propose a reputation incentive committee-based secure conditional dual authentication scheme for VANETs called RIC-SDA. Our proposed scheme incorporates dual authentication of the consensus committee and vehicle-to-vehicle (V2V) communication. It enables the rapid provision of dynamic vehicle epoch-key from consensus committee authentication for V2V authentication through our designed reputation incentive mechanism. To mitigate the potential key-exposure problem, we introduce a novel concept of secure vehicle epoch communication, which means V2V authentication is valid for only one epoch blockchain unit time. The proposed scheme achieves lightweight computation and incurs minimal communication overheads, with the signature size being just 137 bytes. The RIC-SDA scheme supports fast batch verification. We prove that our proposed scheme is unforgeable security under random oracle and demonstrate its feasibility by implementing it in a test network based on Ethereum Sepolia. The results demonstrate that our RIC-SDA solution outperforms the existing state-of-the-art authentication VANET schemes regarding efficiency and communication costs.\",\"PeriodicalId\":50389,\"journal\":{\"name\":\"IEEE Transactions on Mobile Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.7000,\"publicationDate\":\"2024-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10636019/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10636019/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

车载特设网络(VANET)在所有车辆之间建立无线连接,实现无缝移动通信。然而,现有的有条件隐私保护 VANETs 身份验证方案未能解决潜在的密钥暴露问题,也不能提供加速的车辆身份验证。在本文中,我们为 VANETs 提出了一种基于声誉激励委员会的安全条件双重认证方案,称为 RIC-SDA。我们提出的方案结合了共识委员会和车对车(V2V)通信的双重认证。通过我们设计的声誉激励机制,它能从共识委员会认证中快速提供动态车辆历时密钥,用于 V2V 认证。为了缓解潜在的密钥暴露问题,我们引入了安全车辆纪元通信的新概念,这意味着 V2V 认证只在一个纪元区块链单位时间内有效。拟议方案实现了轻量级计算,通信开销极小,签名大小仅为 137 字节。RIC-SDA 方案支持快速批量验证。我们证明了我们提出的方案在随机甲骨文下是不可伪造的,并通过在基于以太坊 Sepolia 的测试网络中实施该方案来证明其可行性。结果表明,在效率和通信成本方面,我们的 RIC-SDA 解决方案优于现有的最先进的验证 VANET 方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs
Vehicular ad hoc networks (VANETs) establish wireless connections among all vehicles, enabling seamless mobile communication. However, existing conditional privacy protection VANETs authentication schemes fail to address the issue of potential key-exposure and do not provide accelerated vehicle authentication. In this paper, we propose a reputation incentive committee-based secure conditional dual authentication scheme for VANETs called RIC-SDA. Our proposed scheme incorporates dual authentication of the consensus committee and vehicle-to-vehicle (V2V) communication. It enables the rapid provision of dynamic vehicle epoch-key from consensus committee authentication for V2V authentication through our designed reputation incentive mechanism. To mitigate the potential key-exposure problem, we introduce a novel concept of secure vehicle epoch communication, which means V2V authentication is valid for only one epoch blockchain unit time. The proposed scheme achieves lightweight computation and incurs minimal communication overheads, with the signature size being just 137 bytes. The RIC-SDA scheme supports fast batch verification. We prove that our proposed scheme is unforgeable security under random oracle and demonstrate its feasibility by implementing it in a test network based on Ethereum Sepolia. The results demonstrate that our RIC-SDA solution outperforms the existing state-of-the-art authentication VANET schemes regarding efficiency and communication costs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信