当前位置: X-MOL 学术Computing › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
Computing ( IF 3.7 ) Pub Date : 2018-12-13 , DOI: 10.1007/s00607-018-0689-3
Sankar Mukherjee , Daya Sagar Gupta , G. P. Biswas

With the rapid increase in the internet technologies, Vehicular Ad hoc Networks (VANETs) are identified as a crucial primitive for the vehicular communication in which the moving vehicles are treated as nodes to form a mobile network. To ameliorate the efficiency and traffic security of the communication, a VANET can wirelessly circulate the traffic information and status to the participating vehicles (nodes). Before deploying a VANET, a security and privacy mechanism must be implemented to assure the secure communication. Due to this issue, a number of conditional privacy-preserving authentication schemes are proposed in the literature to guarantee the mutual authentication and privacy protection. However, most of these schemes use the Diffie–Hellman (DH) problems to secure the communication. Note that, these DH-type problems can be solved in polynomial-time in the presence of new modern technologies like quantum computers. Therefore, to remove these difficulties, we motivated to attempt a non-DH type conditional privacy-preserving authentication scheme which can resist the quantum computers. In this paper, we developed the first lattice-based conditional privacy-preserving authentication (LB-CPPA) protocol for VANETs. A random oracle model is used to analyze the security of proposed protocol. The security of our LB-CPPA scheme is based on the complexity of lattice problems. By security analysis, we show that our proposal endorses the message integrity and authentication as well as the privacy preservation at the same time. A security comparison of our claim is also done. Further, we analyze the performance of the proposed scheme and compare it with the DH-type schemes.

中文翻译:

一种使用格的高效、批量可验证的 VANETs 条件隐私保护认证方案

随着互联网技术的快速发展,车辆自组织网络(VANET)被认为是车辆通信的关键原语,其中移动车辆被视为节点以形成移动网络。为了提高通信的效率和交通安全性,VANET 可以将交通信息和状态无线传递给参与的车辆(节点)。在部署 VANET 之前,必须实施安全和隐私机制以确保安全通信。由于这个问题,文献中提出了许多有条件的隐私保护认证方案,以保证相互认证和隐私保护。然而,这些方案中的大多数使用 Diffie-Hellman (DH) 问题来保护通信。注意,在量子计算机等现代技术的存在下,这些 DH 类型的问题可以在多项式时间内解决。因此,为了克服这些困难,我们有动力尝试一种可以抵抗量子计算机的非 DH 类型的条件隐私保护认证方案。在本文中,我们为 VANET 开发了第一个基于格的条件隐私保护认证(LB-CPPA)协议。随机预言机模型用于分析提议协议的安全性。我们的 LB-CPPA 方案的安全性基于格问题的复杂性。通过安全性分析,我们表明我们的提议同时支持消息完整性和身份验证以及隐私保护。还对我们的声明进行了安全比较。更多,
更新日期:2018-12-13
down
wechat
bug