Towards privacy-preserving data mining in online social networks: Distance-grained and item-grained differential privacy

5Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Online social networks have become increasingly popular, where users are more and more lured to reveal their private information. This brings about convenient personalized services but also incurs privacy concerns. To balance utility and privacy, many privacy-preserving mechanisms such as differential privacy have been proposed. However, most existent solutions set a single privacy protection level across the network, which does not well meet users’ personalized requirements. In this paper, we propose a fine-grained differential privacy mechanism for data mining in online social networks. Compared with traditional methods, our scheme provides query responses with respect to different privacy protection levels depending on where the query is from (i.e., is distancegrained), and also supports different protection levels for different data items (i.e., is item-grained). In addition, we take into consideration the collusion attack on differential privacy, and give a countermeasure in privacy-preserving data mining. We evaluate our scheme analytically, and conduct experiments on synthetic and real-world data to demonstrate its utility and privacy protection.

Cite

CITATION STYLE

APA

Yan, S., Pan, S., Zhao, Y., & Zhu, W. T. (2016). Towards privacy-preserving data mining in online social networks: Distance-grained and item-grained differential privacy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9722, pp. 141–157). Springer Verlag. https://doi.org/10.1007/978-3-319-40253-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free