{"title":"A security-enhanced certificateless conditional privacy-preserving authentication scheme with collusion-resistance for IoV","authors":"Feixiang Ye, 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.
期刊介绍:
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.