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

A technology of the shortest path and nodes, applied in cloud services, encrypted graph data navigation, and privacy protection fields, to achieve the effects of privacy protection, low computing cost computing operations, and strong index security

Pending Publication Date: 2022-07-05
HEFEI UNIV OF TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Graph encryption shortest path query method and system supporting k disordered nodes
  • Graph encryption shortest path query method and system supporting k disordered nodes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0069] In this embodiment, the user module encrypts the graph data and calculates the security index and sends it to the cloud service module, and at the same time, the user module sends a shortest path query of k disordered nodes to the cloud service module and obtains the returned result;

[0070] In this embodiment, a shortest path query system for k disordered nodes, such as figure 1 shown, including a user module and a cloud service module;

[0071] Taking the query processing of dense routes on the cloud in a navigation service as an example, the user module is the user who encrypts the graph data and selects the starting point, the ending point and k disordered nodes to query the route, and the cloud service module is a third-party platform. The user submits his own starting point, ending point and k disordered nodes to the third-party platform, and the third-party platform matches the appropriate shortest route for navigation;

[0072] The user module includes: a syst...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/51G06F16/53G06F7/58G06F21/60G06F21/62H04L9/00
CPCG06F16/51G06F16/53G06F7/582G06F21/602G06F21/6245H04L9/008Y02D30/50
Inventor 李萌高剑博祝烈煌
Owner HEFEI UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap