Chaotic map based efficient anonymous authentication and key agreement scheme for VANETS
- 1Department of Networking and Security, School of Computer Science and Engineering, VIT-AP University, Beside AP Secretariat, Amaravati, Andhra Pradesh, India
Abstract
Vehicular Ad Hoc Networks (VANETs) have been developed as an important technology for improving road safety and traffic efficiency in intelligent transport systems. However, due to the increase in the number of cyberattacks, they have become vulnerable to several security threats that must be addressed. Although several works related to authentication and key agreement protocols have been proposed in the past, there is a significant overhead in both communication and computation. To overcome this burden, a Chebyshev chaotic map-driven anonymous authentication scheme with a key agreement scheme is proposed in this work. This work shows integrates a chaotic map with anonymous authentication, thereby balancing security and efficiency. The proposed scheme removes the bilinear pairing operations, thereby reducing the time required for cryptographic operations, which leads to a significant reduction in computation overhead. Moreover, Quantitative evaluation shows that the proposed scheme achieves a total execution time of only 0.9494ms representing a (49.7%−71%) reduction compared to existing schemes (1.8878-3.7756 ms) and a communication overhead of 264 bytes, which is (13.2%−57.4%) lower than most related works (84–620) bytes. Furthermore, the security analysis section addresses the secure nature of the proposed protocol in contrast to different types of security attacks. The efficiency of the proposed schema is validated against similar works based on the computation time of cryptographic operations using the Cygwin platform and is proven to be noteworthy.
Related
- A study on a privacy preservation method for VANETs based on certificateless anonymous authentication and non-interactive zero-knowledge proof
- Multivariate Cryptography-Based Anonymous Certificate Scheme
- ASCON-Based Pairing-Free Certificateless Authentication and Key Agreement Protocol for IoV
- A Quantum-Resistant Authentication and Key Agreement Protocol for Fog-Assisted Vehicular Networks
- SAMPLIFI: a Secure signal Authentication scheme based on non-linear aMPLIFIcation
BibTeX
@article{sivaprasad2026chaotic,
title = {{Chaotic map based efficient anonymous authentication and key agreement scheme for VANETS}},
author = {Dulam Devee SivaPrasad and Azees Maria},
journal = {PLOS One},
year = {2026},
month = sep,
doi = {10.1371/journal.pone.0357045},
url = {https://doi.org/10.1371/journal.pone.0357045},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Chaotic map based efficient anonymous authentication and key agreement scheme for VANETS
AU - Dulam Devee SivaPrasad
AU - Azees Maria
PY - 2026
DA - 2026/09/02
JO - PLOS One
DO - 10.1371/journal.pone.0357045
UR - https://doi.org/10.1371/journal.pone.0357045
AB - Vehicular Ad Hoc Networks (VANETs) have been developed as an important technology for improving road safety and traffic efficiency in intelligent transport systems. However, due to the increase in the number of cyberattacks, they have become vulnerable to several security threats that must be addressed. Although several works related to authentication and key agreement protocols have been proposed in the past, there is a significant overhead in both communication and computation. To overcome this burden, a Chebyshev chaotic map-driven anonymous authentication scheme with a key agreement scheme is proposed in this work. This work shows integrates a chaotic map with anonymous authentication, thereby balancing security and efficiency. The proposed scheme removes the bilinear pairing operations, thereby reducing the time required for cryptographic operations, which leads to a significant reduction in computation overhead. Moreover, Quantitative evaluation shows that the proposed scheme achieves a total execution time of only 0.9494ms representing a (49.7%−71%) reduction compared to existing schemes (1.8878-3.7756 ms) and a communication overhead of 264 bytes, which is (13.2%−57.4%) lower than most related works (84–620) bytes. Furthermore, the security analysis section addresses the secure nature of the proposed protocol in contrast to different types of security attacks. The efficiency of the proposed schema is validated against similar works based on the computation time of cryptographic operations using the Cygwin platform and is proven to be noteworthy.
SN - 1932-6203
ER -