{"title":"社交网络隐私保护数据发布","authors":"S. Bourahla, Y. Challal","doi":"10.1109/CIS.2017.00063","DOIUrl":null,"url":null,"abstract":"The proliferation of social networks allowed creating a big quantity of data which contains rich private information that should be preserved. In this paper we consider social networks that are represented as labeled bipartite graphs where each node can have a set of information representing its profile. We propose a solution that allows publishing the social network graphs while preserving the privacy of data. We identify a critical \"safety partitioning condition\" which has provable guarantees to prevent variety of privacy attacks. We demonstrate the utility of our solution by studying the accuracy with which complex queries can be answered over the anonymized data.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Social Networks Privacy Preserving Data Publishing\",\"authors\":\"S. Bourahla, Y. Challal\",\"doi\":\"10.1109/CIS.2017.00063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The proliferation of social networks allowed creating a big quantity of data which contains rich private information that should be preserved. In this paper we consider social networks that are represented as labeled bipartite graphs where each node can have a set of information representing its profile. We propose a solution that allows publishing the social network graphs while preserving the privacy of data. We identify a critical \\\"safety partitioning condition\\\" which has provable guarantees to prevent variety of privacy attacks. We demonstrate the utility of our solution by studying the accuracy with which complex queries can be answered over the anonymized data.\",\"PeriodicalId\":304958,\"journal\":{\"name\":\"2017 13th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2017.00063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2017.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Social Networks Privacy Preserving Data Publishing
The proliferation of social networks allowed creating a big quantity of data which contains rich private information that should be preserved. In this paper we consider social networks that are represented as labeled bipartite graphs where each node can have a set of information representing its profile. We propose a solution that allows publishing the social network graphs while preserving the privacy of data. We identify a critical "safety partitioning condition" which has provable guarantees to prevent variety of privacy attacks. We demonstrate the utility of our solution by studying the accuracy with which complex queries can be answered over the anonymized data.