{"title":"不断发展的在线社交网络的隐私保护数据发布","authors":"Wei Chang, Jie Wu","doi":"10.1080/15536548.2016.1143765","DOIUrl":null,"url":null,"abstract":"ABSTRACT The increasing growth of online social networks provides an unprecedented opportunity to study the complex interactions among human beings. Privacy-preserved network-data publishing is becoming increasingly popular in both industry and academia. This articles focuses on evolving social subscription networks (ESSN), which indicate social actors’ participation in certain media channels, such as Hollywood stars’ Twitter pages, during a series of time intervals. The discussion first introduces a new identity disclosure attack by exploring the subscribed channel sizes of a social actor and the actor’s frequency of joining/leaving the channels. For privacy protection, K-anonymity should be ensured for the whole evolving graph. However, unlike the conventional topology information, such as node degree, the ESSN data points are much more sparse. Moreover, during the construction of anonymous groups, the unpopular channel-related information is likely to be discarded. How to maximally preserve ESSN data utility during anonymization is an open problem. These authors propose an effective three-step framework to solve it: data space compression, anonymity construction, and realizable publishing. Also provided are comprehensive studies on the performance of this approach. Extensive results show that this approach is effective in terms of privacy, utility, and efficacy. To the best of the knowledge of these authors, this work is the first systematic study to the anonymization of time-evolving multi-relation graphs.","PeriodicalId":44332,"journal":{"name":"International Journal of Information Security and Privacy","volume":"15 12 1","pages":"14 - 31"},"PeriodicalIF":0.5000,"publicationDate":"2016-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Privacy-preserved data publishing of evolving online social networks\",\"authors\":\"Wei Chang, Jie Wu\",\"doi\":\"10.1080/15536548.2016.1143765\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT The increasing growth of online social networks provides an unprecedented opportunity to study the complex interactions among human beings. Privacy-preserved network-data publishing is becoming increasingly popular in both industry and academia. This articles focuses on evolving social subscription networks (ESSN), which indicate social actors’ participation in certain media channels, such as Hollywood stars’ Twitter pages, during a series of time intervals. The discussion first introduces a new identity disclosure attack by exploring the subscribed channel sizes of a social actor and the actor’s frequency of joining/leaving the channels. For privacy protection, K-anonymity should be ensured for the whole evolving graph. However, unlike the conventional topology information, such as node degree, the ESSN data points are much more sparse. Moreover, during the construction of anonymous groups, the unpopular channel-related information is likely to be discarded. How to maximally preserve ESSN data utility during anonymization is an open problem. These authors propose an effective three-step framework to solve it: data space compression, anonymity construction, and realizable publishing. Also provided are comprehensive studies on the performance of this approach. Extensive results show that this approach is effective in terms of privacy, utility, and efficacy. To the best of the knowledge of these authors, this work is the first systematic study to the anonymization of time-evolving multi-relation graphs.\",\"PeriodicalId\":44332,\"journal\":{\"name\":\"International Journal of Information Security and Privacy\",\"volume\":\"15 12 1\",\"pages\":\"14 - 31\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2016-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Information Security and Privacy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/15536548.2016.1143765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Information Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/15536548.2016.1143765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Privacy-preserved data publishing of evolving online social networks
ABSTRACT The increasing growth of online social networks provides an unprecedented opportunity to study the complex interactions among human beings. Privacy-preserved network-data publishing is becoming increasingly popular in both industry and academia. This articles focuses on evolving social subscription networks (ESSN), which indicate social actors’ participation in certain media channels, such as Hollywood stars’ Twitter pages, during a series of time intervals. The discussion first introduces a new identity disclosure attack by exploring the subscribed channel sizes of a social actor and the actor’s frequency of joining/leaving the channels. For privacy protection, K-anonymity should be ensured for the whole evolving graph. However, unlike the conventional topology information, such as node degree, the ESSN data points are much more sparse. Moreover, during the construction of anonymous groups, the unpopular channel-related information is likely to be discarded. How to maximally preserve ESSN data utility during anonymization is an open problem. These authors propose an effective three-step framework to solve it: data space compression, anonymity construction, and realizable publishing. Also provided are comprehensive studies on the performance of this approach. Extensive results show that this approach is effective in terms of privacy, utility, and efficacy. To the best of the knowledge of these authors, this work is the first systematic study to the anonymization of time-evolving multi-relation graphs.
期刊介绍:
As information technology and the Internet become more and more ubiquitous and pervasive in our daily lives, there is an essential need for a more thorough understanding of information security and privacy issues and concerns. The International Journal of Information Security and Privacy (IJISP) creates and fosters a forum where research in the theory and practice of information security and privacy is advanced. IJISP publishes high quality papers dealing with a wide range of issues, ranging from technical, legal, regulatory, organizational, managerial, cultural, ethical and human aspects of information security and privacy, through a balanced mix of theoretical and empirical research articles, case studies, book reviews, tutorials, and editorials. This journal encourages submission of manuscripts that present research frameworks, methods, methodologies, theory development and validation, case studies, simulation results and analysis, technological architectures, infrastructure issues in design, and implementation and maintenance of secure and privacy preserving initiatives.