LORA: Link Obfuscation by Randomization in Graphs.

In this paper, we propose a randomization scheme, LORA (Link Obfuscation by Randomization), to obfuscate edge existence in graphs. Specifically, we extract the source graph’s hierarchical random graph model and reconstruct the released graph randomly with this model. We show that the released graph can preserve critical graph statistical properties even after a large number of edges have been replaced. To measure the effectiveness of our scheme, we introduce the notion of link entropy to quantify its privacy-preserving strength wrt the existence of edges.