Scalable Local-Recoding Anonymization Using Locality Sensitive Hashing for Big Data Privacy Preservation
Title | Scalable Local-Recoding Anonymization Using Locality Sensitive Hashing for Big Data Privacy Preservation |
Publication Type | Conference Paper |
Year of Publication | 2016 |
Authors | Zhang, Xuyun, Leckie, Christopher, Dou, Wanchun, Chen, Jinjun, Kotagiri, Ramamohanarao, Salcic, Zoran |
Conference Name | Proceedings of the 25th ACM International on Conference on Information and Knowledge Management |
Publisher | ACM |
Conference Location | New York, NY, USA |
ISBN Number | 978-1-4503-4073-1 |
Keywords | Big Data, big data privacy, big data security, big data securityComputing Theory, cloud, composability, Computing Theory, hash algorithms, Human Behavior, in the cloud, LSH, MapReduce, Metrics, privacy preservation, pubcrawl, Resiliency, security metrics |
Abstract | While cloud computing has become an attractive platform for supporting data intensive applications, a major obstacle to the adoption of cloud computing in sectors such as health and defense is the privacy risk associated with releasing datasets to third-parties in the cloud for analysis. A widely-adopted technique for data privacy preservation is to anonymize data via local recoding. However, most existing local-recoding techniques are either serial or distributed without directly optimizing scalability, thus rendering them unsuitable for big data applications. In this paper, we propose a highly scalable approach to local-recoding anonymization in cloud computing, based on Locality Sensitive Hashing (LSH). Specifically, a novel semantic distance metric is presented for use with LSH to measure the similarity between two data records. Then, LSH with the MinHash function family can be employed to divide datasets into multiple partitions for use with MapReduce to parallelize computation while preserving similarity. By using our efficient LSH-based scheme, we can anonymize each partition through the use of a recursive agglomerative \$k\$-member clustering algorithm. Extensive experiments on real-life datasets show that our approach significantly improves the scalability and time-efficiency of local-recoding anonymization by orders of magnitude over existing approaches. |
URL | http://doi.acm.org/10.1145/2983323.2983841 |
DOI | 10.1145/2983323.2983841 |
Citation Key | zhang_scalable_2016 |