Graph encryption shortest path query method and system supporting k disordered nodes

Abstract

The invention discloses a graph encryption shortest path query method and system supporting k unordered nodes. The graph encryption shortest path query method and system are applied to an environment formed by a user module and a cloud service module. The user module processes the original graph data to calculate a security index encrypted by the graph, generates a query token according to k disordered queried nodes, uploads the security index and the query token to the cloud service module, decrypts to obtain the shortest path after a query result is sent back, and otherwise, waits for the query result all the time; and the cloud service module receives the security index and the query token from the user module, searches the security index by using the query token and returns the shortest path passing through the k disordered nodes. According to the method, the path query privacy of the user can be protected from being damaged by the untrusted cloud service.

Description

technical field [0001] The invention relates to a graph encryption shortest path query method and system supporting k disordered nodes, belonging to the technical fields of privacy protection, cloud services and encrypted graph data navigation. Background technique [0002] Graph databases are used in a variety of applications, including the World Wide Web, online social networks, and communication networks. For example, LinkedIn has a social network graph of more than 8.1 million users. These applications facilitate efficient query and analysis of large-scale graphs. [0003] With the popularity of cloud computing, users, including companies and individuals, are increasingly encouraged to outsource their graph databases to remote cloud servers to reduce local management costs. However, outsourcing a graph database containing sensitive information to an untrusted cloud server not only causes users to lose control of their data, but also raises their security concerns. The...

AI Technical Summary

Problems solved by technology

[0006] In order to solve the shortcomings of the above-mentioned prior art, the present invention proposes a graph encryption shortest path query method and system supporting k disordered nodes, in order to resist untrustworthy data in the process of querying encrypted state graph data on the cloud The security threat of the cloud storage party, and solve the shortest path query demand problem of k disordered nodes, so as to protect the user's privacy and ensure that the user's travel route and needs are not known by the untrusted data cloud storage party

Images