ABSTRACT
In this paper, we propose a novel k-anonymization scheme to counter deanonymization queries on social networks. With this scheme, all entities are protected by k-anonymization, which means the attackers cannot re-identify a target with confidence higher than 1/k. The proposed scheme minimizes the modification on original networks, and accordingly maximizes the utility preservation of published data while achieving k-anonymization privacy protection. Extensive experiments on real data sets demonstrate the effectiveness of the proposed scheme, where the efficacy of the k-anonymized networks is verified with the distributions of pagerank, betweenness, and their Kolmogorov-Smirnov (K-S) test.
- H. Yang, I. Soboroff. Privacy-preserving IR 2015: When information retrieval meets privacy and security. In Proc. SIGIR, pp. 1157--1158, 2015. Google ScholarDigital Library
- H. Hsieh, C. Li, R. Yan. I See You: Person-of-Interest Search in Social Networks. In Proc. SIGIR, pp. 839--842, 2015. Google ScholarDigital Library
- S. Ji, W. Li, M. Srivatsa, R. Beyah, Structural data de-anonymization: theory and practice, IEEE/ACM Transactions on Networking, 24(6), pp. 3523--3536, 2016. Google ScholarDigital Library
- H. Fu, A. Zhang, X. Xie. Effective Social Graph Deanonymization Based on Graph Structure and Descriptive Information. ACM Trans. Intell. Syst. Technol., 6(4), pp. 49:1--49:29, 2015.Google ScholarDigital Library
- B. Zhou, J. Pei. Preserving Privacy in Social Networks Against Neighborhood Attacks. In Proc. IEEE International Conference on Data Engineering, pp. 506--515, 2008. Google ScholarDigital Library
- G. Wang, Q. Liu, F. Li, S. Yang, and J. Wu, Outsourcing Privacy-Preserving Social Networks to a Cloud, In Proc. IEEE INFOCOM, pp. 2886--2894, 2013. Google ScholarCross Ref
- Q. Liu, G. Wang, F. Li, S. Yang, J. Wu. Preserving privacy with probabilistic indistinguishability in weighted Social networks, IEEE Transactions on Parallel and Distributed Systems, 28(5), pp. 1417--1492, 2017. Google ScholarDigital Library
- L. Lu, T. Zhou, Q. Zhang, H. Stanley.The h-index of a network node and its relation to degree and coreness, Nature Communications, 7:10168, DOI: 10.1038/ncomms10168, 2016. Google ScholarCross Ref
Recommendations
Effective Social Graph Deanonymization Based on Graph Structure and Descriptive Information
Regular Papers and Special Section on Intelligent Healthcare InformaticsThe study of online social networks has attracted increasing interest. However, concerns are raised for the privacy risks of user data since they have been frequently shared among researchers, advertisers, and application developers. To solve this ...
Protecting User Privacy Better with Query l-Diversity
This paper examines major privacy concerns in location-based services. Most user privacy techniques are based on cloaking, which achieves location k-anonymity. The key is to reduce location resolution by ensuring that each cloaking area reported to a ...
A privacy-aware visual query approach for location-based data
AbstractVisual querying of location-based data assists users in expressing query requirements, investigating query results and making inferences. However, directly accessing data records exposes individual location information and may cause privacy ...
Graphical abstractDisplay Omitted
Highlights- Directly query location data may lead to privacy issues.
- Anonymizing data preserves data privacy but limits data utility.
- Graph-based anonymization sanitizes data privacy effectively and dynamically.
- Interactive visual query ...
Comments