Scholarlink

<p>VANET makes the vehicles transmit information to each other over an insecure channel and communicate with fixed roadside units (RSUs). Traditional authentication schemes in VANETs are designed within an identity-based framework. Although this identity-based system eliminates the drawbacks of Public Key Infrastructure, it has critical escrow problems. Because of the features of VANET, the works of literature do not have too many certificateless signcryption for authentication schemes, and most of these schemes use pairing operation and aggregation. However, time-consuming pairing operations on elliptic curves are a significant problem. Therefore, there has been much research on how to be more efficient. RSU must perform batch authentication when receiving many signatures to reduce the computation cost and verification time. This article proposes a CertificateLess Signcryption Mutual Authentication (CLSMA) scheme for vehicle-to-vehicle (V2V) to eliminate any pairing operation on elliptic curves, reduce the computation required for authentication, and maintain data integrity, and a CertificateLess Signcryption Batch Authentication (CLSBA) scheme for vehicle-to-infrastructure (V2I) to solve the problem of a large amount of RSU computing in the traditional scheme, and prove that the proposed CertificateLess Signcryption for Mutual and Batch Authentication (CLSMBA) scheme is secure under the complex problem of CDHP and ECDLP in the random oracle model. Then, we discuss how to resist common attacks and achieve security goals. In addition, we analyze the CLSMBA scheme through theoretical analysis to get the computational and transmission costs. We compare them with similar existing schemes to show the effectiveness and advantages of our scheme. The comparison results show that our scheme is more efficient than other schemes in terms of signcryption, verification, and communication overhead. Therefore, the proposal is more suitable to be applied in VANETs. Moreover, we utilized AVISPA’s back-end engines to confirm that the proposed CLSMBA resists replay and man-in-the-middle attacks, and we used Python to implement the CLSMBA and other existing schemes to validate our theoretical analysis.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An efficient certificateless signcryption for mutual and batch authentication in Vehicular Ad-hoc Networks (VANETs)

  • 期刊论文

  • 发表日期：

    2025年6月9日

查看全文
  • Wei-Kuo Chiang,
  • Wen-Yi Wang

摘要

VANET makes the vehicles transmit information to each other over an insecure channel and communicate with fixed roadside units (RSUs). Traditional authentication schemes in VANETs are designed within an identity-based framework. Although this identity-based system eliminates the drawbacks of Public Key Infrastructure, it has critical escrow problems. Because of the features of VANET, the works of literature do not have too many certificateless signcryption for authentication schemes, and most of these schemes use pairing operation and aggregation. However, time-consuming pairing operations on elliptic curves are a significant problem. Therefore, there has been much research on how to be more efficient. RSU must perform batch authentication when receiving many signatures to reduce the computation cost and verification time. This article proposes a CertificateLess Signcryption Mutual Authentication (CLSMA) scheme for vehicle-to-vehicle (V2V) to eliminate any pairing operation on elliptic curves, reduce the computation required for authentication, and maintain data integrity, and a CertificateLess Signcryption Batch Authentication (CLSBA) scheme for vehicle-to-infrastructure (V2I) to solve the problem of a large amount of RSU computing in the traditional scheme, and prove that the proposed CertificateLess Signcryption for Mutual and Batch Authentication (CLSMBA) scheme is secure under the complex problem of CDHP and ECDLP in the random oracle model. Then, we discuss how to resist common attacks and achieve security goals. In addition, we analyze the CLSMBA scheme through theoretical analysis to get the computational and transmission costs. We compare them with similar existing schemes to show the effectiveness and advantages of our scheme. The comparison results show that our scheme is more efficient than other schemes in terms of signcryption, verification, and communication overhead. Therefore, the proposal is more suitable to be applied in VANETs. Moreover, we utilized AVISPA’s back-end engines to confirm that the proposed CLSMBA resists replay and man-in-the-middle attacks, and we used Python to implement the CLSMBA and other existing schemes to validate our theoretical analysis.