CONCEALING SENSITIVE PATTERNS FROM LINKED DATA GRAPHS
First Claim
1. A method to conceal sensitive patterns from Linked Data Graphs comprising:
- receiving at a hardware processor, data representing a Linked Data graph form (data graph G) and a set of patterns S to be concealed in said data graph G;
identifying one or more bindings in graph G which lead to the discovery of the patterns S; and
removing each of the one or more bindings in the data graph G to form a new data graph G′
such that the patterns discoverable in G, cannot be discovered in graph G′
said hardware processor configured to perform said identifying and binding breaking in said data graph.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, system and computer program product for preventing sensitive pattern disclosures from Linked Data graphs. The proposed method (i) receives as input a Linked Data graph and a set of query patterns that correspond to sensitive knowledge that needs to be concealed, and (b) minimally distorts the Linked Data graph to generate a sanitized counterpart (graph) in which only the non-sensitive patterns can be discovered. The method supports a variety of utility functions, which it optimizes during the graph sanitization process. The resulting, sanitized graph can be subsequently used for publishing and/or querying purposes.
89 Citations
20 Claims
-
1. A method to conceal sensitive patterns from Linked Data Graphs comprising:
-
receiving at a hardware processor, data representing a Linked Data graph form (data graph G) and a set of patterns S to be concealed in said data graph G; identifying one or more bindings in graph G which lead to the discovery of the patterns S; and removing each of the one or more bindings in the data graph G to form a new data graph G′
such that the patterns discoverable in G, cannot be discovered in graph G′said hardware processor configured to perform said identifying and binding breaking in said data graph. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system for concealing sensitive patterns from Linked Data Graphs comprising:
-
a memory storage device; a hardware processor programmed with instructions from said memory storage device to configure said hardware processor to; receive data representing a Linked Data graph form (data graph G); receive data representing a set of patterns to be concealed in said data graph G; identify one or more bindings in data graph G which lead to the discovery of the patterns; and remove each of the one or more bindings in the data graph G to form a new data graph G′
such that said patterns discoverable in G, cannot be discovered in graph G′
. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A computer program product to conceal sensitive patterns from Linked Data Graphs comprising:
-
a storage medium, wherein said storage medium is not a propagating signal, said storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising; receiving data representing a Linked Data graph form (data graph G); receiving data representing a set of patterns to be concealed in said data graph G, identifying one or more bindings in data graph G which lead to the discovery of the patterns; and removing each of the one or more bindings in the said data graph G to form a new data graph G′
such that said sensitive patterns discoverable in G, cannot be discovered in graph G′
. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification