GUARANTEEING ANONYMITY OF LINKED DATA GRAPHS

摘要

A method, system and computer program product for transforming a Linked Data graph into a corresponding anonymous Linked Data graph, in which semantics is preserved and links can be followed to expand the anonymous graph up to r times without breaching anonymity (i.e., anonymity under r-dereferenceability). Anonymizing a Linked Data graph under r- dereferenceability provides privacy guarantees of ^-anonymity or /-diversity variants, while taking into account and preserving the rich semantics of the graph.