Lattice-Based Conditional Privacy-Preserving Authentication Protocol for the Vehicular Ad Hoc Network

被引:34
作者
Li, Quanrun [1 ,2 ]
He, Debiao [1 ,3 ,4 ]
Yang, Zhichao [5 ]
Xie, Qi [6 ]
Choo, Kim-Kwang Raymond [7 ,8 ]
机构
[1] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan 430072, Peoples R China
[2] Guilin Univ Elect Technol, Guangxi Key Lab Trusted Software, Guilin 541004, Peoples R China
[3] Qilu Univ Technol, Shandong Acad Sci, Shandong Prov Key Lab Comp Networks, Jinan 250014, Peoples R China
[4] Matrix Elements Technol, Shanghai Key Lab Privacy Preserving Computat, Shanghai 201204, Peoples R China
[5] Naval Univ Engn, Dept Informat Secur, Wuhan 430000, Peoples R China
[6] Hangzhou Normal Univ, Key Lab Cryptog Zhejiang Prov, Hangzhou 311121, Peoples R China
[7] Univ Texas San Antonio, Dept Informat Syst & Cyber Secur, San Antonio, TX 78249 USA
[8] Univ Texas San Antonio, Dept Elect & Comp, San Antonio, TX 78249 USA
基金
中国国家自然科学基金;
关键词
Protocols; Privacy; Security; Authentication; Gaussian distribution; Lattices; Costs; Lattice; mutual authentication; privacy-preserving; random oracle model; small integer solution problem; vehicular ad hoc network(VANET); ANONYMOUS AUTHENTICATION; SCHEME; EFFICIENT; SECURE;
D O I
10.1109/TVT.2022.3147875
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Vehicular ad hoc network (VANET) underpins most intelligent transportation systems and given the open nature of the wireless communication environment, edge nodes in the VANET are subject to varying levels of attacks. While there are a large number of conditional privacy-preserving authentication protocols in the literature, most of these protocols (whose security is guaranteed by classical cryptographic primitives) are not designed to resist quantum attacks. In this paper, we propose a lattice-based conditional privacy-preserving authentication protocol for VANETs, designed to simultaneously achieve mutual authentication and privacy protection. We also show that our protocol is secure in the random oracle model, relying on the small integer solution problem. Additionally, we demonstrate the potential utility of our protocol by evaluating its performance.
引用
收藏
页码:4336 / 4347
页数:12
相关论文
共 29 条
[1]   An efficient conditional privacy-preserving authentication scheme for Vehicle-To-Infrastructure communication in VANETs [J].
Ali, Ikram ;
Li, Fagen .
VEHICULAR COMMUNICATIONS, 2020, 22
[2]  
Alwen J., 2009, Proceedings of STACS, V09001, P75, DOI DOI 10.4230/LIPICS.STACS
[3]   EAAP: Efficient Anonymous Authentication With Conditional Privacy-Preserving Scheme for Vehicular Ad Hoc Networks [J].
Azees, Maria ;
Vijayakumar, Pandi ;
Deboarh, Lazarus Jegatha .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2017, 18 (09) :2467-2476
[4]  
Bagherzandi A, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P449
[5]   LCPPA: Lattice-based conditional privacy preserving authentication in vehicular communication [J].
Dharminder, Dharminder ;
Mishra, Dheerendra .
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2020, 31 (02)
[6]   Incentive mechanism for cooperative authentication: An evolutionary game approach [J].
Fang, Liang ;
Shi, Guozhen ;
Wang, Lianhai ;
Li, Yongjun ;
Xu, Shujiang ;
Guo, Yunchuan .
INFORMATION SCIENCES, 2020, 527 :369-381
[7]   BPAS: Blockchain-Assisted Privacy-Preserving Authentication System for Vehicular Ad Hoc Networks [J].
Feng, Qi ;
He, Debiao ;
Zeadally, Sherali ;
Liang, Kaitai .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (06) :4146-4155
[8]  
Gentry C, 2008, ACM S THEORY COMPUT, P197
[9]   An Efficient Identity-Based Conditional Privacy-Preserving Authentication Scheme for Vehicular Ad Hoc Networks [J].
He, Debiao ;
Zeadally, Sherali ;
Xu, Baowen ;
Huang, Xinyi .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2015, 10 (12) :2681-2691
[10]   An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks [J].
Horng, Shi-Jinn ;
Tzeng, Shiang-Feng ;
Huang, Po-Hsian ;
Wang, Xian ;
Li, Tianrui ;
Khan, Muhammad Khurram .
INFORMATION SCIENCES, 2015, 317 :48-66