Jianwei Qian
Xiang-Yang Li
Yu Wang
Skip Abstract Section
Abstract
Previous works on social network de-anonymization focus on designing accurate and efficient de-anonymization methods. We attempt to investigate the intrinsic relationship between the attacker’s knowledge and the expected de-anonymization gain. A common intuition is that more knowledge results in more successful de-anonymization. However, our analysis shows this is not necessarily true if the attacker uses the full background knowledge for de-anonymization. Our findings leave intriguing implications for the attacker to make better use of the background knowledge for de-anonymization and for the data owners to better measure the privacy risk when releasing their data to third parties.
- Réka Albert and Albert-László Barabási. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 1 (2002), 47.Google Scholar
Cross Ref
- Noga Alon, Phuong Dao, Iman Hajirasouliha, Fereydoun Hormozdiari, and S. Cenk Sahinalp. 2008. Biomolecular network motif counting and discovery by color coding. Bioinformatics 24, 13 (2008), i241--i249. Google ScholarCross Ref
- László Babai. 2015. Graph isomorphism in quasipolynomial time. Arxiv Preprint Arxiv:1512.03547 (2015).Google Scholar
- Lars Backstrom, Cynthia Dwork, and Jon Kleinberg. 2007. Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography. In Proceedings of the World Wide Web Conference (WWW’07). ACM, 181--190. Google ScholarDigital Library
- Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali, Fabrizio Petrini, Xinyu Que, Yogish Sabharwal, and Baruch Schieber. 2016. Subgraph counting: Color coding beyond trees. Arxiv Preprint Arxiv:1602.04478 (2016).Google Scholar
- James Cheng, Ada Wai-chee Fu, and Jia Liu. 2010. K-isomorphism: Privacy preserving network publication against structural attacks. In Proceedings of the ACM Special Interest Group on Management of Data (SIGMOD). ACM, 459--470. Google ScholarDigital Library
- Carla-Fabiana Chiasserini, Michele Garetto, and Emilio Leonardi. 2016. Social network de-anonymization under scale-free user relations. IEEE/ACM Trans. Netw. 24, 6 (2016), 3756--3769. Google ScholarDigital Library
- Shah Chirag, Capra Robert, and Preben Hansen. 2014. Collaborative information seeking: Guest editors’ introduction. Computer 47, 3 (2014), 22--25. Google ScholarDigital Library
- Krzysztof Choromański, Michał Matuszak, and Jacek Miekisz. 2013. Scale-free graph with preferential attachment and evolving internal vertex structure. J. Stat. Phys. 151, 6 (2013), 1175--1183.Google ScholarCross Ref
- Fan Chung and Linyuan Lu. 2002. Connected components in random graphs with given expected degree sequences. Ann. Combinat. 6, 2 (2002), 125--145.Google ScholarCross Ref
- Stephen A. Cook. 1971. The complexity of theorem-proving procedures. In Proceedings of the ACM Symposium on Theory of Computing (STOC’71). ACM, 151--158. Google ScholarDigital Library
- Paul Erdös and Alfréd Rényi. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5 (1960), 17--61.Google Scholar
- Rosalba Giugno and Dennis Shasha. 2002. Graphgrep: A fast and universal method for querying graphs. In Proceedings of the 16th International Conference on Pattern Recognition, Vol. 2. IEEE, 112--115.Google ScholarCross Ref
- Michael Hay, Gerome Miklau, David Jensen, Philipp Weis, and Siddharth Srivastava. 2007. Anonymizing social networks. Comput. Sci. Dept. Faculty Publicat. Ser. (2007), 180.Google Scholar
- Svante Janson. 1990. Poisson approximation for large deviations. Random Struct. Algor. 1, 2 (1990), 221--229.Google ScholarCross Ref
- Svante Janson, Krzysztof Oleszkiewicz, and Andrzej Ruciński. 2004. Upper tails for subgraph counts in random graphs. Israel J. Math. 142, 1 (2004), 61--92.Google ScholarCross Ref
- Shouling Ji, Weiqing Li, Neil Zhenqiang Gong, Prateek Mittal, and Raheem Beyah. 2015. On your social network de-anonymizablity: quantification and large scale evaluation with seed knowledge. In Proceedings of the Network and Distributed System Security Symposium (NDSS’15). ISOC.Google ScholarCross Ref
- Shouling Ji, Weiqing Li, Mudhakar Srivatsa, and Raheem Beyah. 2014. Structural data de-anonymization: Quantification, practice, and implications. In Proceedings of the Conference on Computer and Communications Security (CCS’14). ACM, 1040--1053. Google ScholarDigital Library
- Taeho Jung, Xiang-Yang Li, Wenchao Huang, Zhongying Qiao, Jianwei Qian, Linlin Chen, Junze Han, and Jiahui Hou. 2019. AccountTrade: Accountability against dishonest big data buyers and sellers. IEEE Trans. Info. Forens. Secur. 14, 1 (2019), 223--234.Google ScholarCross Ref
- Ninghui Li, Tiancheng Li, and Suresh Venkatasubramanian. 2007. t-closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of the IEEE International Conference on Data Engineering (ICDE’07). IEEE, 106--115.Google ScholarCross Ref
- Xiang-Yang Li, Jianwei Qian, and Xiaoyang Wang. 2018. Can china lead the development of data trading and sharing markets?Commun. ACM 61, 11 (2018), 50--51. Google ScholarDigital Library
- Xiang-Yang Li, Chunhong Zhang, Taeho Jung, Jianwei Qian, and Linlin Chen. 2016. Graph-based privacy-preserving data publication. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM’16). IEEE.Google ScholarDigital Library
- Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, and Muthuramakrishnan Venkitasubramaniam. 2007. l-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data 1, 1 (2007), 3. Google ScholarDigital Library
- Lev Muchnik, Sen Pei, Lucas C. Parra, Saulo D. S. Reis, José S. Andrade Jr., Shlomo Havlin, and Hernán A. Makse. 2013. Origins of power-law degree distribution in the heterogeneity of human activity in social networks. Sci. Rep. 3 (2013).Google Scholar
- Arvind Narayanan and Vitaly Shmatikov. 2009. De-anonymizing social networks. In Proceedings of the IEEE Symposium on Security and Privacy (S8P’09). 173--187. Google ScholarDigital Library
- David F. Nettleton and Julián Salas. 2016. A data driven anonymization system for information rich online social network graphs. Expert Syst. Appl. 55 (2016), 87--105. Google ScholarDigital Library
- Pedram Pedarsani, Daniel R. Figueiredo, and Matthias Grossglauser. 2013. A Bayesian method for matching two similar graphs without seeds. In Proceedings of the Annual Allerton Conference on Communication, Control, and Computing (Allerton’13). 1598--1607.Google ScholarCross Ref
- Wei Peng, Feng Li, Xukai Zou, and Jie Wu. 2012. Seed and grow: An attack against anonymized social networks. In IEEE International Conference on Sensing, Communication and Networking (SECON’12). IEEE, 587--595.Google ScholarCross Ref
- Wei Peng, Feng Li, Xukai Zou, and Jie Wu. 2014. A two-stage deanonymization attack against anonymized social networks. Trans. Comput. 63, 2 (2014), 290--303. Google ScholarDigital Library
- Eric Prud’hommeaux, Andy Seaborne et al. 2008. SPARQL query language for RDF. W3C Recommendation 15 (2008).Google Scholar
- Jianwei Qian, Haohua Du, Jiahui Hou, Linlin Chen, Taeho Jung, and Xiang-Yang Li. 2018. Hidebehind: Enjoy voice input with voiceprint unclonability and anonymity. In Proceedings of the ACM Conference on Embedded Networked Sensor Systems (SenSys’18). ACM, 82--94. Google ScholarDigital Library
- Jianwei Qian, Feng Han, Jiahui Hou, Chunhong Zhang, Yu Wang, and Xiang-Yang Li. 2018. Towards privacy-preserving speech data publishing. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’18). IEEE.Google ScholarCross Ref
- Jianwei Qian, Xiang-Yang Li, Chunhong Zhang, and Linlin Chen. 2016. De-anonymizing social networks and inferring private attributes using knowledge graphs. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’16). IEEE.Google ScholarDigital Library
- Jianwei Qian, Xiang-Yang Li, Chunhong Zhang, Linlin Chen, Taeho Jung, and Junze Han. 2017. Social network de-anonymization and privacy inference with knowledge graph model. IEEE Trans. Depend. Secure Comput. (2017).Google Scholar
- Per O. Seglen. 1992. The skewness of science. J. Amer. Soc. Info. Sci. 43, 9 (1992), 628--638.Google ScholarCross Ref
- George M. Slota and Kamesh Madduri. 2013. Fast approximate subgraph counting and enumeration. In International Conference on Parallel Processing (ICPP’13). IEEE, 210--219. Google ScholarDigital Library
- Zhao Sun, Hongzhi Wang, Haixun Wang, Bin Shao, and Jianzhong Li. 2012. Efficient subgraph matching on billion node graphs. Proc. Very Large Data Base 5, 9 (2012), 788--799. Google ScholarDigital Library
- Latanya Sweeney. 2002. k-anonymity: A model for protecting privacy. Int. J. Uncertain. Fuzz. Knowl.-Based Syst. 10, 05 (2002), 557--570. Google ScholarDigital Library
- Chih-Hua Tai, Philip S. Yu, De-Nian Yang, and Ming-Syan Chen. 2011. Privacy-preserving social network publication against friendship attacks. In International Conference on Knowledge Discovery and Data Mining (SIGKDD’11). ACM, 1262--1270. Google ScholarDigital Library
- Guojun Wang, Qin Liu, Feng Li, Shuhui Yang, and Jie Wu. 2013. Outsourcing privacy-preserving social networks to a cloud. In IEEE Conference on Computer Communications (INFOCOM’13). 2886--2894.Google ScholarCross Ref
- Xinyu Wu, Zhongzhao Hu, Xinzhe Fu, Luoyi Fu, Xinbing Wang, and Songwu Lu. 2018. Social network de-anonymization with overlapping communities: Analysis, algorithm and experiments. In IEEE Conference on Computer Communications (INFOCOM’18). IEEE.Google ScholarCross Ref
- Zhe Xu, Jay Ramanathan, and Rajiv Ramnath. 2014. Identifying knowledge brokers and their role in enterprise research through social media. Computer3 (2014), 26--31. Google ScholarDigital Library
- Bin Zhou and Jian Pei. 2008. Preserving privacy in social networks against neighborhood attacks. In Proceedings of the International Conference on Data Engineering Workshops (ICDE’08). 506--515. Google ScholarDigital Library
- Lei Zou, Lei Chen, and M. Tamer Özsu. 2009. Distance-join: Pattern match query in a large graph database. Proc. Very Large Data Base 2, 1 (2009), 886--897. Google ScholarDigital Library
- Lei Zou, Lei Chen, and M. Tamer Özsu. 2009. K-automorphism: A general framework for privacy preserving network publication. Proc. Very Large Data Base 2, 1 (2009), 946--957. Google ScholarDigital Library
Index Terms
- Social Network De-anonymization: More Adversarial Knowledge, More Users Re-identified?
Recommendations
An Efficient and Robust Social Network De-anonymization Attack
WPES '16: Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic SocietyReleasing connection data from social networking services can pose a significant threat to user privacy. In our work, we consider structural social network de-anonymization attacks, which are used when a malicious party uses connections in a public or ...
Hierarchical anonymization algorithms against background knowledge attack in data releasing
We define a privacy model based on k-anonymity and one of its strong refinements to prevent the background knowledge attack.We propose two hierarchical anonymization algorithm to satisfy our privacy model.Our algorithms outperform the state-of the art ...
Identities Anonymization in Dynamic Social Networks
ICDM '11: Proceedings of the 2011 IEEE 11th International Conference on Data MiningPrivacy in social network data publishing is always an important concern. Nowadays most prior privacy protection techniques focus on static social networks. However, there are additional privacy disclosures in dynamic social networks due to the ...
Comments