A security-enhanced certificateless conditional privacy-preserving authentication scheme with collusion-resistance for IoV

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-01-31 DOI:10.1016/j.comnet.2025.111084
Feixiang Ye, Wanqing Wu
{"title":"A security-enhanced certificateless conditional privacy-preserving authentication scheme with collusion-resistance for IoV","authors":"Feixiang Ye,&nbsp;Wanqing Wu","doi":"10.1016/j.comnet.2025.111084","DOIUrl":null,"url":null,"abstract":"<div><div>Currently, Certificateless Conditional Privacy-Preserving Authentication (CLCPPA) schemes have been widely adopted to address security and privacy issues in the Internet of Vehicles (IoV). Recently, Genc et al. proposed an efficient CLCPPA scheme based on Elliptic Curve Cryptography (ECC), named ELCPAS, which features non-pairing, lightweight, and low-cost characteristics. It also supports batch verification to improve the efficiency of verifying multiple signatures. Unfortunately, the analysis reveals that this scheme is vulnerable to the forgery signature attack from Type-1 and Type-2 adversaries under the certificateless cryptography security model. Additionally, the batch verification algorithm in this scheme, as well as in most related CLCPPA schemes, is susceptible to the collusion attack from the emerging Type-3 adversary. To this end, we analyze Genc et al.’s scheme and provide the attack processes and countermeasures in detail. In particular, we present two potential attack ways from the Type-3 adversary, named injection and signature-swapping attacks. Then, a security-enhanced CLCPPA scheme with collusion-resistance for IoV is proposed, which can be formally proven to resist forgery attacks from Type-1 and Type-2 adversaries based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). Meanwhile, for the Type-3 adversary, we propose the security model applicable to the batch verification scenario and introduce the Small Exponent Test (SET) technology to withstand such attacks, along with the rigorous formal security proof for this method. Performance analysis shows that compared with related CLCPPA schemes, the proposed scheme not only provides more comprehensive security but also maintains lower costs. Specifically, compared with Genc et al.’s scheme, the proposed scheme can maintain similar performance while ensuring enhanced security.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"259 ","pages":"Article 111084"},"PeriodicalIF":4.4000,"publicationDate":"2025-01-31","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/S1389128625000520","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

Currently, Certificateless Conditional Privacy-Preserving Authentication (CLCPPA) schemes have been widely adopted to address security and privacy issues in the Internet of Vehicles (IoV). Recently, Genc et al. proposed an efficient CLCPPA scheme based on Elliptic Curve Cryptography (ECC), named ELCPAS, which features non-pairing, lightweight, and low-cost characteristics. It also supports batch verification to improve the efficiency of verifying multiple signatures. Unfortunately, the analysis reveals that this scheme is vulnerable to the forgery signature attack from Type-1 and Type-2 adversaries under the certificateless cryptography security model. Additionally, the batch verification algorithm in this scheme, as well as in most related CLCPPA schemes, is susceptible to the collusion attack from the emerging Type-3 adversary. To this end, we analyze Genc et al.’s scheme and provide the attack processes and countermeasures in detail. In particular, we present two potential attack ways from the Type-3 adversary, named injection and signature-swapping attacks. Then, a security-enhanced CLCPPA scheme with collusion-resistance for IoV is proposed, which can be formally proven to resist forgery attacks from Type-1 and Type-2 adversaries based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). Meanwhile, for the Type-3 adversary, we propose the security model applicable to the batch verification scenario and introduce the Small Exponent Test (SET) technology to withstand such attacks, along with the rigorous formal security proof for this method. Performance analysis shows that compared with related CLCPPA schemes, the proposed scheme not only provides more comprehensive security but also maintains lower costs. Specifically, compared with Genc et al.’s scheme, the proposed scheme can maintain similar performance while ensuring enhanced security.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约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.
期刊最新文献
Mx-TORU: Location-aware multi-hop task offloading and resource optimization protocol for connected vehicle networks PoVF: Empowering decentralized blockchain systems with verifiable function consensus Reunion: Receiver-driven network load balancing mechanism in AI training clusters Towards Open RAN in beyond 5G networks: Evolution, architectures, deployments, spectrum, prototypes, and performance assessment GRL-RR: A Graph Reinforcement Learning-based resilient routing framework for software-defined LEO mega-constellations
×
引用
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