Provable secure dynamic lightweight group communication in VANETs

被引:4
作者
Naresh, Vankamamidi Srinivasa [1 ]
Reddi, Sivaranjani [2 ]
Allavarpu, V. V. L. Divakar [3 ]
机构
[1] Sri Vasavi Engn Coll, Dept Comp Sci & Engn, Tadepalligudeam 534101, Andhra Pradesh, India
[2] Anil Neerukonda Inst Technol & Sci, Dept Comp Sci & Engn, Visakhapatnam, Andhra Pradesh, India
[3] GITAM Deemed Univ, GITAM Inst Management, FinTech Acad, Visakhapatnam, Andhra Pradesh, India
关键词
GROUP KEY AGREEMENT; AUTHENTICATION SCHEME; PROTOCOL;
D O I
10.1002/ett.4273
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
The advent of group-oriented communication applications in Vehicular Ad Hoc Networks (VANETs) has trigger research on lightweight privacy-preserving Secure Group Communication (SGC) in VANETs. In view of this, many researchers proposed privacy-preserving, authentication, and key agreements schemes. However, these schemes need to address the dynamic nature, heavier processing loads, massive storage, and higher communication. In this direction, we proposed a framework for lightweight dynamic SGC with privacy-preserving and authentication in VANETs, encompassing (i) A lightweight Elliptic Curve Cryptography (ECC)-based two-party key agreement and its extension to a Dynamic Group Key Agreement, in which fixed Road Side Unit (RSU) acts as Group Controller (GC) with superior computational ability than the On-Board Unit equipped on the vehicles. (ii) An identify-based authentication and privacy-preserving schemes using only two lightweight operations XOR and hashing. (iii) A lightweight encryption and decryption with Exclusive Or (XOR) and hashing only. And (iv) a formal security model for SGC in VANETs. The security analysis shows that the proposed system provides confidentiality of session key, anonymity, secure session key enhancement, and immune to password guessing attack, replay attack, insider attack based on an assumption of the computational G-ECDDH problem. The experimentation is done for authentication, group key agreement, encryption, and decryption times by a varying number of vehicles in the group to 10, 20, 40, 60, 80, and 100 and shown that the proposed technique is taking considerably less computation than other techniques. So the proposed technique is highly desirable in VANETs.
引用
收藏
页数:22
相关论文
共 29 条
[1]   Dynamic Multiple Junction Selection Based Routing Protocol for VANETs in City Environment [J].
Abbasi, Irshad Ahmed ;
Khan, Adnan Shahid ;
Ali, Shahzad .
APPLIED SCIENCES-BASEL, 2018, 8 (05)
[2]  
Abuelela M, 2009, VEH TECHNOL CONFE, P2185
[3]   A comprehensive survey on handover management for vehicular ad hoc network based on 5G mobile networks technology [J].
Ahmed, Adel A. ;
Alzahrani, Ahmad A. .
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2019, 30 (03)
[4]  
Bhakthavathsalam R., 2009, P IEEE PES GEN M, P1
[5]  
Dorronsoro B, 2014, NATU COMPUT SER, P1, DOI 10.1002/9781118833209
[6]   Provably secure constant round contributory group key agreement in dynamic setting [J].
Dutta, Ratna ;
Barua, Rana .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (05) :2007-2025
[7]   A Self-Authentication and Deniable Efficient Group Key Agreement Protocol for VANET [J].
Han, Mu ;
Hua, Lei ;
Ma, Shidian .
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2017, 11 (07) :3678-3698
[8]  
Jin-Ho Kim, 2010, 2010 14th Biennial IEEE Conference on Electromagnetic Field Computation (CEFC 2010), DOI 10.1109/CEFC.2010.5481044
[9]  
Lee JL, 2018, IEEE CONF COMPUT, P57
[10]   ACPN: A Novel Authentication Framework with Conditional Privacy-Preservation and Non-Repudiation for VANETs [J].
Li, Jie ;
Lu, Huang ;
Guizani, Mohsen .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (04) :938-948