Please use this identifier to cite or link to this item:
|Title:||LORA: Link obfuscation by randomization in graphs|
|Keywords:||Hierarchical Random Graph|
|Source:||Xiao, Q.,Wang, Z.,Tan, K.-L. (2011). LORA: Link obfuscation by randomization in graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6933 LNCS : 33-51. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-23556-6_3|
|Abstract:||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. © 2011 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.