Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Randomized privacy protection method for graph data release

A technology of randomizing privacy and graph data, which is applied in digital data protection, electronic digital data processing, computer security devices, etc., can solve the problems of data publishing privacy leakage, and achieve the effect of good probability distribution characteristics

Active Publication Date: 2017-04-26
GUANGXI NORMAL UNIV
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The technical problem to be solved by the present invention is the problem of privacy leakage in existing data publishing, and a randomized privacy protection method for graph data publishing is provided

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
  • Randomized privacy protection method for graph data release
  • Randomized privacy protection method for graph data release
  • Randomized privacy protection method for graph data release

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] This embodiment takes figure 1 The original graph network data shown is taken as an example to illustrate the proposed randomized graph data publishing privacy protection method.

[0028] figure 1 The original graph data shown is simple undirected graph data G=(V, E), where V is an entity participating in the network, and E is a relationship between entities.

[0029] Adjacency matrices are commonly used in computers to store and process graph data. Adjacency matrix A=[a ij ] is an n×n 0-1 matrix, where when node v i and v j a ij = 1, otherwise a ij =0. figure 1 The original graph data shown, that is, the matrix of the adjacency matrix A corresponding to the graph data G is expressed as:

[0030]

[0031] The adjacency matrix A is a symmetric matrix, and each edge in the data corresponds to two symmetric non-zero entries in the matrix. In order to realize the random disturbance algorithm of the present invention, the upper triangular matrix B is introduced. ...

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 randomized privacy protection method for graph data release. Graph data are processed through a randomized disturbance method, and the data processed by the randomized privacy protection method can be shared and released to an unspecified third party without infringing privacy information of a user included in the data. Meanwhile, the processed graph data have a high probability distribution feature, and relevant parameters can be adjusted flexibly according to the requirement on privacy protection intensity.

Description

technical field [0001] The invention relates to the technical field of data release, in particular to a randomized privacy protection method for graph data release. Background technique [0002] Graph data can be used to describe the predation relationship between species, the semantic connection between words, the network connection between computers, the citation relationship between scientific research articles, the traffic flow relationship, and even the human emotional relationship. When the entity nodes in the graph data involve people, if the data is directly released or improperly shared with a third party, privacy leakage issues may arise. For example, if the attacker knows that the attacked object has two friends, and there is only one node with two friends in the published data, the target node can be relocated in the published data. Therefore, it is necessary to process the data before the data is released to protect the privacy of users in the data from being l...

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): G06F21/62
CPCG06F21/6254
Inventor 刘鹏李先贤王利娥
Owner GUANGXI NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com