LB-CLAS: Lattice-based conditional privacy-preserving certificateless aggregate signature scheme for VANET

IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS
Sheng-wei Xu , Shu-han Yu , Yi-Jie Bai , Zi-Yan Yue , Yi-Long Liu
{"title":"LB-CLAS: Lattice-based conditional privacy-preserving certificateless aggregate signature scheme for VANET","authors":"Sheng-wei Xu ,&nbsp;Shu-han Yu ,&nbsp;Yi-Jie Bai ,&nbsp;Zi-Yan Yue ,&nbsp;Yi-Long Liu","doi":"10.1016/j.vehcom.2024.100843","DOIUrl":null,"url":null,"abstract":"<div><p>The rapid development of vehicular ad-hoc networks (VANETs) has brought great convenience to intelligent transportation, and the secure transmission of information in VANETs has become a serious problem. In addition, the protection of private information of vehicles is also a key issue. Aiming at the problem of how to guarantee the secure transmission of information in VANETs under the condition of satisfying security and privacy, we propose a lattice-based conditional privacy-preserving certificateless aggregate signature scheme (LB-CLAS) for VANETs. Instead of using Number Theory Research Unit (NTRU) lattices and discrete Gaussian sampling, the proposed LB-CLAS scheme is based on algebraic lattice. In addition, based on the module version of Small Integer Solution (MSIS) and module version of Learning With Error (MLWE) hard problems, we prove that the LB-CLAS scheme is existential unforgeability under adaptively chosen message attacks (EUF-CMA). Our LB-CLAS scheme employs individual signature verification in vehicle-to-vehicle (V2V) mode, while utilizing aggregate signatures and batch verification in vehicle-to-infrastructure (V2I) mode, with slightly differing transmission parameters between the two modes. Based on Dilithium, our LB-CLAS scheme solves the problem of high storage overhead and computational cost of existing schemes. The performance analysis shows that our LB-CLAS scheme is more efficient in terms of computation cost, storage overhead, and power consumption compared to existing schemes. Compared with existing schemes, our LB-CLAS scheme reduces the signature and verification overheads by more than 17.6% and 43.4%, respectively. Our LB-CLAS program also has significant advantages in batch verification. As the number of vehicles increases, our batch certification time cost is reduced by more than 90%. In addition, our LB-CLAS scheme has the smallest signature length, with a signature size that is 1X smaller than the most efficient existing scheme for the same level of security.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"50 ","pages":"Article 100843"},"PeriodicalIF":5.8000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2214209624001189/pdfft?md5=d16493d6df4ea967cee7aafc78f227fc&pid=1-s2.0-S2214209624001189-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vehicular Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214209624001189","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The rapid development of vehicular ad-hoc networks (VANETs) has brought great convenience to intelligent transportation, and the secure transmission of information in VANETs has become a serious problem. In addition, the protection of private information of vehicles is also a key issue. Aiming at the problem of how to guarantee the secure transmission of information in VANETs under the condition of satisfying security and privacy, we propose a lattice-based conditional privacy-preserving certificateless aggregate signature scheme (LB-CLAS) for VANETs. Instead of using Number Theory Research Unit (NTRU) lattices and discrete Gaussian sampling, the proposed LB-CLAS scheme is based on algebraic lattice. In addition, based on the module version of Small Integer Solution (MSIS) and module version of Learning With Error (MLWE) hard problems, we prove that the LB-CLAS scheme is existential unforgeability under adaptively chosen message attacks (EUF-CMA). Our LB-CLAS scheme employs individual signature verification in vehicle-to-vehicle (V2V) mode, while utilizing aggregate signatures and batch verification in vehicle-to-infrastructure (V2I) mode, with slightly differing transmission parameters between the two modes. Based on Dilithium, our LB-CLAS scheme solves the problem of high storage overhead and computational cost of existing schemes. The performance analysis shows that our LB-CLAS scheme is more efficient in terms of computation cost, storage overhead, and power consumption compared to existing schemes. Compared with existing schemes, our LB-CLAS scheme reduces the signature and verification overheads by more than 17.6% and 43.4%, respectively. Our LB-CLAS program also has significant advantages in batch verification. As the number of vehicles increases, our batch certification time cost is reduced by more than 90%. In addition, our LB-CLAS scheme has the smallest signature length, with a signature size that is 1X smaller than the most efficient existing scheme for the same level of security.

LB-CLAS:用于 VANET 的基于网格的有条件隐私保护无证书聚合签名方案
车载 ad-hoc 网络(VANET)的快速发展为智能交通带来了极大的便利,而 VANET 中信息的安全传输已成为一个严峻的问题。此外,车辆私人信息的保护也是一个关键问题。针对如何在满足安全性和隐私性的条件下保证信息在 VANET 中安全传输的问题,我们提出了一种适用于 VANET 的基于网格的条件隐私保护无证书聚合签名方案(LB-CLAS)。所提出的 LB-CLAS 方案不使用数论研究单元(NTRU)网格和离散高斯采样,而是基于代数网格。此外,基于模块版小整数解(MSIS)和模块版错误学习(MLWE)难题,我们证明了 LB-CLAS 方案在自适应选择消息攻击(EUF-CMA)下的存在不可伪造性。我们的 LB-CLAS 方案在车对车(V2V)模式下采用单个签名验证,而在车对基础设施(V2I)模式下采用集合签名和批量验证,两种模式下的传输参数略有不同。基于 Dilithium,我们的 LB-CLAS 方案解决了现有方案的高存储开销和计算成本问题。性能分析表明,与现有方案相比,我们的 LB-CLAS 方案在计算成本、存储开销和功耗方面更加高效。与现有方案相比,我们的 LB-CLAS 方案分别减少了 17.6% 和 43.4% 以上的签名和验证开销。我们的 LB-CLAS 方案在批量验证方面也有显著优势。随着车辆数量的增加,我们的批量验证时间成本降低了 90% 以上。此外,我们的 LB-CLAS 方案具有最小的签名长度,其签名大小是同等安全等级下现有最高效方案的 1 倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Vehicular Communications
Vehicular Communications Engineering-Electrical and Electronic Engineering
CiteScore
12.70
自引率
10.40%
发文量
88
审稿时长
62 days
期刊介绍: Vehicular communications is a growing area of communications between vehicles and including roadside communication infrastructure. Advances in wireless communications are making possible sharing of information through real time communications between vehicles and infrastructure. This has led to applications to increase safety of vehicles and communication between passengers and the Internet. Standardization efforts on vehicular communication are also underway to make vehicular transportation safer, greener and easier. The aim of the journal is to publish high quality peer–reviewed papers in the area of vehicular communications. The scope encompasses all types of communications involving vehicles, including vehicle–to–vehicle and vehicle–to–infrastructure. The scope includes (but not limited to) the following topics related to vehicular communications: Vehicle to vehicle and vehicle to infrastructure communications Channel modelling, modulating and coding Congestion Control and scalability issues Protocol design, testing and verification Routing in vehicular networks Security issues and countermeasures Deployment and field testing Reducing energy consumption and enhancing safety of vehicles Wireless in–car networks Data collection and dissemination methods Mobility and handover issues Safety and driver assistance applications UAV Underwater communications Autonomous cooperative driving Social networks Internet of vehicles Standardization of protocols.
×
引用
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学术官方微信