Quantum-resistant ring signature-based authentication scheme against secret key exposure for VANETs

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Xiaoling Yu , Yuntao Wang , Xin Huang
{"title":"Quantum-resistant ring signature-based authentication scheme against secret key exposure for VANETs","authors":"Xiaoling Yu ,&nbsp;Yuntao Wang ,&nbsp;Xin Huang","doi":"10.1016/j.comnet.2025.111213","DOIUrl":null,"url":null,"abstract":"<div><div>Vehicular ad-hoc networks (VANETs) can improve traffic management efficiency and driving safety to support the construction of Intelligent Transportation System. Privacy protection in VANETs is one of the challenges that cannot be ignored. To this end, the ring signature is a promising cryptographic primitive for providing privacy protection and authentication. However, in practical ring signature-based VANETs, secret keys of vehicle users used for signing are often exposed because of network attacks or careless use. So far, most predecessors do not guarantee security from secret key exposure. Moreover, many existing ring signature-based systems for VANETs are fragile under quantum computer attacks. In this paper, we construct the first forward secure ring signature scheme from lattices. Based on this scheme, we then design a ring signature-based authentication system for VANETs to guarantee privacy-preserving authentication, message integrity, forward security, and post-quantum security. Our scheme combines the binary tree and lattice basis delegation technique to realize a one-way key update mechanism, where secret keys are ephemeral and updated with generating nodes in the binary tree. Thus, the adversary cannot forge the past signature even if the users’ present secret keys are revealed, which can reduce the damage from key exposure. Furthermore, we give rigorous security proof under the hardness assumption of the underlying Small Integer Solution (SIS) problem in lattice-based cryptography to realize post-quantum security. Finally, we show simulation experiments and comparative analysis to evaluate its performance.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111213"},"PeriodicalIF":4.4000,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625001811","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Vehicular ad-hoc networks (VANETs) can improve traffic management efficiency and driving safety to support the construction of Intelligent Transportation System. Privacy protection in VANETs is one of the challenges that cannot be ignored. To this end, the ring signature is a promising cryptographic primitive for providing privacy protection and authentication. However, in practical ring signature-based VANETs, secret keys of vehicle users used for signing are often exposed because of network attacks or careless use. So far, most predecessors do not guarantee security from secret key exposure. Moreover, many existing ring signature-based systems for VANETs are fragile under quantum computer attacks. In this paper, we construct the first forward secure ring signature scheme from lattices. Based on this scheme, we then design a ring signature-based authentication system for VANETs to guarantee privacy-preserving authentication, message integrity, forward security, and post-quantum security. Our scheme combines the binary tree and lattice basis delegation technique to realize a one-way key update mechanism, where secret keys are ephemeral and updated with generating nodes in the binary tree. Thus, the adversary cannot forge the past signature even if the users’ present secret keys are revealed, which can reduce the damage from key exposure. Furthermore, we give rigorous security proof under the hardness assumption of the underlying Small Integer Solution (SIS) problem in lattice-based cryptography to realize post-quantum security. Finally, we show simulation experiments and comparative analysis to evaluate its performance.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信