Anonymity-based shortest path privacy protection method in network

A technology of shortest path and privacy protection, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve the problem of lack of shortest path protection methods, and achieve the effect of privacy protection in complex networks

Active Publication Date: 2021-02-09
ANHUI NORMAL UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The existing privacy protection only protects a single node and edge in the network graph. At present, people still lack the shortest path protection method between nodes.

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
  • Anonymity-based shortest path privacy protection method in network
  • Anonymity-based shortest path privacy protection method in network
  • Anonymity-based shortest path privacy protection method in network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] Referring to the accompanying drawings, through the description of the embodiments, the specific embodiments of the present invention include the shape, structure, mutual position and connection relationship of each part, the function and working principle of each part, and the manufacturing process of the various components involved. And the method of operation and use, etc., are described in further detail to help those skilled in the art have a more complete, accurate and in-depth understanding of the inventive concepts and technical solutions of the present invention.

[0041] like figure 1 As shown, the anonymity-based network shortest path privacy protection method includes the following steps:

[0042] Step 1. Model the complex network in the real world as a weighted undirected graph G=(V, E), where V represents a node set, E represents an edge set, and an adjacency matrix is ​​used to represent the graph G. W is used to represent the edge weight matrix of verti...

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 an anonymity-based network shortest path privacy protection method, which performs formal modeling on complex networks. Define the virtual node set and virtual edge set, establish the distance matrix, and use the dynamic programming idea to solve the shortest path between the node pairs; protect the shortest path between the node pairs according to the needs, use the coverage count to classify the nodes, and increase the interference nodes. vertices and interference edges to achieve privacy protection for the shortest path. The present invention realizes the anonymization protection of the shortest path between node pairs by adding interference nodes and interference edges, thereby effectively defending against attackers' malicious attacks on the relationship paths between node pairs.

Description

technical field [0001] The invention belongs to the technical field of information security protection for weighted user relationship graphs in complex networks, and in particular relates to searching for the shortest path in the complex network and anonymizing the shortest path. Background technique [0002] Because of its inherent characteristics, the search for the shortest path of the network is actually to find a path with the minimum sum of edge weights from the target source point to the target end point on the basis of the established graphical model. Now, the algorithms that are mainly used to search the shortest path in the network include Dijkstra's algorithm and Floyd's algorithm. [0003] The Dijkstra algorithm is based on a greedy strategy. Each time the node closest to the target source point is selected, the shortest path between the target source point and the node is temporarily determined, and then it is checked whether other nodes can update the shortest ...

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 Patents(China)
IPC IPC(8): H04L12/721H04L12/733H04L12/24G06F9/455H04L29/06H04L45/122
Inventor 徐平安孙丽萍刘孝庆腾莉罗永龙
Owner ANHUI NORMAL UNIV
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