1. A method to guarantee anonymity under r-dereferenceability in a Linked Data graph comprising: transforming an original Linked Data graph structure having labeled 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 making a URI determined as breaching said anonymity non-dereferenceable, wherein a computing system including at least one processor unit performs one or more of: the transforming, iteratively expanding, determining and said dereferencing.