A Link Removal Method for Network Structure Privacy Preservation Against Link Prediction

A privacy protection and network structure technology, which is applied in the field of link deletion of network structure privacy protection, can solve problems such as insufficient protection of important target links, untargeted privacy protection, and reduced availability of network structures, so as to achieve retained availability and strong resistance The effect of link attack capability and good network availability

Active Publication Date: 2021-06-08
XIDIAN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] To sum up, the existing network structure perturbation methods have certain defects: 1. The availability of the network structure is greatly reduced
Because of the addition of false links, new network security issues have arisen in the network, such as false link detection; 2. The existing methods mainly consider the privacy protection of the overall network structure, that is, assuming that all links in the network need privacy protection, resulting in Privacy protection is not targeted, and the protection of important target links is insufficient

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
  • A Link Removal Method for Network Structure Privacy Preservation Against Link Prediction
  • A Link Removal Method for Network Structure Privacy Preservation Against Link Prediction

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0052] In this example, see figure 2 , there are 6 nodes in the original network link set, namely a, b, c, d, e and f; there are 9 undirected links, respectively (a, b), (a, c), (b, d), (b,c), (c,d), (d,e), (d,f), (e,c) and (e,f). The dotted line represents the target link, the solid line represents the non-target link, and the deletion budget K=2.

[0053] Set the initial weight values ​​of all links in the current network link set to 0; link deletion counter i=1. Select (b, c) and (d, e) as the target link by random sampling, find out the common neighbors a and d of the two end nodes of the (b, c) target link; find out the (d, e) target The common neighbors c and f of the two end nodes of the link. For (b, c) target link, add 1 to the weight value of the link between b and c end nodes and common neighbors a and d; for (d, e) target link, add d and e end nodes to Add 1 to the weight value of the link between common neighbors c and f; the link with the final weight value ...

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 link deletion method for network structure privacy protection against link prediction, which includes the following steps: S1: selecting several target links from the original network link set; Deletion of the network link set; and given deletion budget K and link deletion counter i, where: i=0; S2: Set the initial weight value of all links in the current network link set to 0; link deletion counter i =i+1; S3: Find the common neighbors of the two end nodes of each target link; for each target link, add 1 to the weight value of the link between each end node and the common neighbor; S4 : when the maximum weight value is greater than 0 and i is not greater than K; go to S5, otherwise go to S7; S5: select a link with the largest weight value and delete it; S6: update the current network link set in S2, and return to S2; S7: End. The present invention can realize better preservation of original network availability and better privacy protection purpose.

Description

technical field [0001] The invention belongs to the technical field of cyberspace security and privacy protection, and relates to a link deletion method for network structure privacy protection against link prediction. Background technique [0002] In today's digital age, data privacy leakage has become one of the most difficult network security issues. In particular, the privacy protection of social network structural data is particularly important, which is mainly reflected in two points: 1) social network structural data is the basis for people to study social networks; 2) some important links (or edges) in social networks are often It is sensitive, such as the private friendship between two users, and the leakage of privacy may cause huge mental distress or economic losses to the users. We call sensitive links in the network "target links" because they are often the target of attackers. Typically, target links are only a small fraction of all links. Of course, the use...

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): H04L29/06H04L29/08
CPCH04L63/0407H04L67/143
Inventor 蒋忠元王强陈贤宇李辉马建峰沈玉龙
Owner XIDIAN 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