Lattice-Based Conditional Privacy-Preserving Batch Authentication Protocol for Fog-Assisted Vehicular Ad Hoc Networks

IF 6.3 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS IEEE Transactions on Information Forensics and Security Pub Date : 2024-10-09 DOI:10.1109/TIFS.2024.3477305
Long Li;Chingfang Hsu;Man Ho Au;Jianqun Cui;Lein Harn;Zhuo Zhao
{"title":"Lattice-Based Conditional Privacy-Preserving Batch Authentication Protocol for Fog-Assisted Vehicular Ad Hoc Networks","authors":"Long Li;Chingfang Hsu;Man Ho Au;Jianqun Cui;Lein Harn;Zhuo Zhao","doi":"10.1109/TIFS.2024.3477305","DOIUrl":null,"url":null,"abstract":"The vehicular ad hoc network (VANET) is a basic component of intelligent transportation systems. Due to the growing security and privacy-preserving requirements of the VANET, a lot of conditional privacy-preserving authentication (CPPA) protocols have been proposed in recent years. Unfortunately, the traditional CPPA protocols, which are based on a trusted authority (TA) and rely solely on classical mathematical problems, cannot resist quantum attacks. Moreover, these protocols do not take into account the increasingly complex traffic flow in the VANET and cannot utilize fog nodes (FNs) to assist in the TA’s authentication work. In this paper, we design a lattice-based and fog-assisted conditional privacy-preserving authentication (LFCPPA) protocol to solve the above challenges. Compared to existing solutions, we have made the following improvements. First, our protocol is resistant to quantum attacks. Second, the solution supports batch processing of signature verification and mutual authentication of identity between the TA / FNs and vehicles. Third, in our design, FNs reduce the computing pressure of the TA to improve the efficiency of the system. In addition, we demonstrate the security of the protocol under the random oracle model with provable security. Finally, the efficiency and security of this scheme are better than similar solutions. Specifically, compared with the latest scheme, in terms of computational cost, our scheme is reduced by 74.47%, 85.58%, 19.69%, and 85.90% in the four stages of the protocol. Meanwhile, in terms of communication cost, our protocol reduces it by 89.98%.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"19 ","pages":"9629-9642"},"PeriodicalIF":6.3000,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10711880/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

The vehicular ad hoc network (VANET) is a basic component of intelligent transportation systems. Due to the growing security and privacy-preserving requirements of the VANET, a lot of conditional privacy-preserving authentication (CPPA) protocols have been proposed in recent years. Unfortunately, the traditional CPPA protocols, which are based on a trusted authority (TA) and rely solely on classical mathematical problems, cannot resist quantum attacks. Moreover, these protocols do not take into account the increasingly complex traffic flow in the VANET and cannot utilize fog nodes (FNs) to assist in the TA’s authentication work. In this paper, we design a lattice-based and fog-assisted conditional privacy-preserving authentication (LFCPPA) protocol to solve the above challenges. Compared to existing solutions, we have made the following improvements. First, our protocol is resistant to quantum attacks. Second, the solution supports batch processing of signature verification and mutual authentication of identity between the TA / FNs and vehicles. Third, in our design, FNs reduce the computing pressure of the TA to improve the efficiency of the system. In addition, we demonstrate the security of the protocol under the random oracle model with provable security. Finally, the efficiency and security of this scheme are better than similar solutions. Specifically, compared with the latest scheme, in terms of computational cost, our scheme is reduced by 74.47%, 85.58%, 19.69%, and 85.90% in the four stages of the protocol. Meanwhile, in terms of communication cost, our protocol reduces it by 89.98%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于网格的雾辅助车载 Ad Hoc 网络条件式隐私保护批量验证协议
车载临时网络(VANET)是智能交通系统的基本组成部分。由于 VANET 对安全性和隐私保护的要求越来越高,近年来提出了很多条件隐私保护认证(CPPA)协议。遗憾的是,传统的 CPPA 协议以可信机构(TA)为基础,完全依赖于经典数学问题,无法抵御量子攻击。此外,这些协议没有考虑到 VANET 中日益复杂的交通流,也无法利用雾节点(FN)来协助 TA 进行身份验证工作。在本文中,我们设计了一种基于网格和雾节点辅助的有条件隐私保护认证(LFCPPA)协议来解决上述难题。与现有解决方案相比,我们做了以下改进。首先,我们的协议可以抵御量子攻击。其次,该方案支持批量处理 TA / FN 与车辆之间的签名验证和身份相互认证。第三,在我们的设计中,FN 可减轻 TA 的计算压力,从而提高系统效率。此外,我们还证明了该协议在随机甲骨文模型下的安全性。最后,该方案的效率和安全性都优于同类方案。具体来说,与最新方案相比,在计算成本方面,我们的方案在协议的四个阶段分别降低了 74.47%、85.58%、19.69% 和 85.90%。同时,在通信成本方面,我们的协议降低了 89.98%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
期刊最新文献
Attackers Are Not the Same! Unveiling the Impact of Feature Distribution on Label Inference Attacks Backdoor Online Tracing With Evolving Graphs LHADRO: A Robust Control Framework for Autonomous Vehicles Under Cyber-Physical Attacks Towards Mobile Palmprint Recognition via Multi-view Hierarchical Graph Learning Succinct Hash-based Arbitrary-Range Proofs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1