Conditional Privacy-preserving Authentication and Message Dissemination Scheme using Timestamp based Pseudonyms for VANETs

被引:1
|
作者
Dina, Ayesha S. [1 ]
Manivannan, D. [1 ]
机构
[1] Univ Kentucky, Dept Comp Sci, Lexington, KY USA
关键词
VANETs; Security; Privacy; Conditional Privacy;
D O I
10.1109/IWCMC58020.2023.10182609
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many of the privacy-preserving authentication and message dissemination approaches presented in the literature for Vehicular Ad Hoc Networks (VANETs) use pseudonyms. Under these schemes, each vehicle is assigned a set of pseudonyms by a central authority and the vehicles use these pseudonyms in all communications to preserve their privacy. Vehicles change their pseudonym (choosing from the pool of pseudonyms assigned) to prevent from being tracked. For authenticating a message sent by a vehicle using its pseudonym, certificate of the pseudonym signed by the central authority is used. When a vehicle is found to be malicious, the certificates issued for all the pseudonyms assigned to that vehicle have to be revoked. The list of certificates revoked need to be communicated to all entities that will correspond with the vehicle and they will store them in their certificate revocation list (CRL). Since the pool of pseudonyms allocated to each vehicle is large (assuming a vehicle changes pseudonym every 5 minutes, it will need more than 100,000 pseudonyms in a year) number of pseudonyms, the CRL can grow very large as the number of vehicles revoked increases which will result in high storage overhead (for storing CRL) and authentication overhead (because each time a message is received, the receiver has to check its CRL to see if that pseudonym). In this paper, we address this issue and present a timestamp based pseudonym allocation scheme.
引用
下载
收藏
页码:530 / 535
页数:6
相关论文
共 50 条
  • [31] An efficient conditional privacy-preserving authentication scheme for Vehicle-To-Infrastructure communication in VANETs
    Ali, Ikram
    Li, Fagen
    VEHICULAR COMMUNICATIONS, 2020, 22
  • [32] Analysis and Improvement of a Conditional Privacy-Preserving Authentication Scheme with Double-Insurance in VANETs
    Wen J.
    Bai L.
    Wang H.
    Liu J.
    Wang Y.
    Zhang H.
    IEEE Transactions on Vehicular Technology, 2024, 73 (11) : 1 - 11
  • [33] An Efficient Identity-Based Privacy-Preserving Authentication Scheme for VANETs
    Cui, Jie
    Xu, Wenyu
    Sha, Kewei
    Zhong, Hong
    COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING, COLLABORATECOM 2017, 2018, 252 : 508 - 518
  • [34] Security Analysis of Conditional Privacy-Preserving Authentication Schemes for VANETs
    Shim, Kyung-Ah
    IEEE ACCESS, 2023, 11 : 33956 - 33963
  • [35] A pseudonym-based certificateless privacy-preserving authentication scheme for VANETs
    Qi, Jiayu
    Gao, Tianhan
    Deng, Xinyang
    Zhao, Cong
    VEHICULAR COMMUNICATIONS, 2022, 38
  • [36] Conditional Privacy-Preserving Authentication Scheme for IoV Based on ECC
    Xie, Peng-Shou
    Pan, Xiao-Jie
    Wang, Hong
    Wang, Jia-Lu
    Feng, Tao
    Yan, Yan
    International Journal of Network Security, 2022, 24 (03) : 501 - 510
  • [37] Privacy-Preserving Authentication Based on PUF for VANETs
    Li, Lihui
    Deng, Hanwen
    Zhai, Zhongyi
    Peng, Sheng-Lung
    Future Internet, 2024, 16 (09):
  • [38] An Efficient Blockchain-Based Conditional Privacy-Preserving Authentication Protocol for VANETs
    Zhou, Xiaotong
    He, Debiao
    Khan, Muhammad Khurram
    Wu, Wei
    Choo, Kim-Kwang Raymond
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (01) : 81 - 92
  • [39] Hardware Secure Module Based Lightweight Conditional Privacy-Preserving Authentication for VANETs
    Zhang, Zihou
    Li, Jiangtao
    Li, Yufeng
    Cao, Chenhong
    Cao, Zhenfu
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2024, 19 : 6337 - 6350
  • [40] EBCPA: Efficient Blockchain-Based Conditional Privacy-Preserving Authentication for VANETs
    Lin, Chao
    Huang, Xinyi
    He, Debiao
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (03) : 1818 - 1832