Patent ID: 9692768
Date: 2017-06-27
CPC Classifications: G06F,H04L

Claim:
1. A computer implemented method for maintaining graphs for sharing confidential data using multiple levels of summarization with varying data utility and privacy protection, the method comprising: maintaining, by a computer, a first graph comprising a plurality of nodes and a plurality of edges, each node comprising content and each edge representing a relationship between a pair of nodes, at least some of the edges representing confidential data; creating, by the computer, a second graph from the first graph, the creating of the second graph from the first graph comprising at least: grouping the nodes of the first graph into a plurality of subsets; for each specific grouped subset of nodes, combining each node of the specific subset into a super-node comprising content of each node of the specific subset; and, for each specific super-node, combining at least one edge of each node that was combined into the specific super-node into at least one super-edge, wherein each super-edge represents a relationship between the specific super-node and another super-node; maintaining the second graph, the nodes of the second graph comprising the created super-nodes and the edges of the second graph comprising the created super-edges, at least one edge of the first graph being omitted from the second graph, and the second graph lacking confidential data represented by the at least one omitted edge of the first graph; tracking, by the computer, steps for restoring each edge of the first graph omitted from the second graph; and providing, by the computer, the second graph to at least one party.