Abstract
With the advent of Internet technologies, the concept of conventional vehicular ad hoc network is gradually migrating into the Internet of Vehicles (IoV). Meanwhile, as a common data structure composed of vertices and edges, graph commonly used to represent road network typologies, are also outsourced to Internet servers for the convenience of people in IoV accessing the road network anytime and anywhere. However, it introduces much potential risks on people’s privacy as the Internet servers are often assumed semi-honest. As an essential component in IoV, privacy-preserving shortest distance query has been researched many years in the cryptographic community. Unfortunately, most of the solutions are designed under symmetric key setting and employ some off-the-shelf cryptographic primitives. They are impractical in the multiuser IoV environment due to an inherent weakness—key agreement required between each pair of a graph data provider and a user since the symmetric key encryption was born. Moreover, these off-the-shelf primitives ask multiple Internet servers or graph data providers to interact in the test process in order to assist one Internet server returning the shortest distance to users, both of which thereby raise a significant communication cost. To overcome these drawbacks, in this article, we propose an asymmetric searchable encryption scheme supporting shortest distance query, which is quite suitable for multiuser IoV environment since the key agreement is no longer required between each pair of a graph data provider and a user. In particular, we present a new cryptographic primitive instead of leveraging any ready-made one, that enables only one server in IoV to be required for returning the final query result—shortest distance to users without any interaction with others, thereby reducing the communication cost. Finally, a strict mathematical security proof is offered as well as some security attacks are analyzed, followed by an experimental evaluation and comparison.
Funding Information
  • National Natural Science Foundation of China (61802241, 71473194)
  • Guangxi Key Laboratory of Trusted Software (KX202308)
  • Natural Science Foundation of Shaanxi Province (2020JM-513, 2024JC-YBQN-0665)
  • National Natural Science Foundation of China Youth Project (62403375)
  • Scientific research project of Shaanxi Provincial Education Department (23JK0541)
  • Natural Science Basic Research Program of Shaanxi (2023-JC-YB-594)