1. A computer program product to guarantee anonymity under r-dereferenceability in a Linked Data graph, the computer program product 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: transforming an original Linked Data graph structure having labelled nodes interconnected by directed edges into a corresponding anonymous Linked Data graph, with one or more nodes embodying a searchable Uniform Research Indicator (URI); iteratively expanding said corresponding anonymous Linked Data graph up to r times, where r is an integer, wherein in each expansion additional information nodes embodied by additional URIs and property values are added to the anonymized Linked Data graph nodes; and determining from each said additional URIs and property values in said expanded corresponding anonymous Linked Data graph whether anonymity is breached, and in that case making the URI determined as breaching said anonymity non-dereferenceable.