{"title":"社会意识隐私保护相关数据收集","authors":"Guocheng Liao, Xu Chen, Jianwei Huang","doi":"10.1145/3209582.3209584","DOIUrl":null,"url":null,"abstract":"We study a privacy-preserving data collection problem, by jointly considering data reporters' data correlation and social relationship. A data collector gathers data from individuals to perform a certain analysis with a privacy-preserving mechanism. Due to data correlation, the data analysis based on the reported data can cause privacy leakage to other individuals (even if they do not report data). The data reporters will take such a privacy threat into account, owing to the social relationship among individuals. This motivates us to formulate a two-stage Stackelberg game: In Stage I, the data collector selects some individuals as data reporters and designs a privacy-preserving mechanism for a sum query analysis. In Stage II, the selected data reporters contribute their data with possible perturbations (through adding noise). By analyzing the data reporters' equilibrium decisions in Stage II, we show that given any fixed reporter set, only one data reporter with the most significant joint consideration of the social relationship and data correlation may add noise to his reported data. The rest of the data reporters will truthfully report their data. In Stage I, we derive the data collector's optimal privacy-preserving mechanism and propose an efficient algorithm to select the data reporters. We conclude that the data collector should jointly capture the impact of data correlation and social relation to ensure all data reporters truthfully reporting their data. We conduct extensive simulations based on random network and real-world social data to investigate the impact of data correlation and social network on the system. We find that the availability of social network information is more critical to the data collector compared with data correlation information.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Social-Aware Privacy-Preserving Correlated Data Collection\",\"authors\":\"Guocheng Liao, Xu Chen, Jianwei Huang\",\"doi\":\"10.1145/3209582.3209584\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study a privacy-preserving data collection problem, by jointly considering data reporters' data correlation and social relationship. A data collector gathers data from individuals to perform a certain analysis with a privacy-preserving mechanism. Due to data correlation, the data analysis based on the reported data can cause privacy leakage to other individuals (even if they do not report data). The data reporters will take such a privacy threat into account, owing to the social relationship among individuals. This motivates us to formulate a two-stage Stackelberg game: In Stage I, the data collector selects some individuals as data reporters and designs a privacy-preserving mechanism for a sum query analysis. In Stage II, the selected data reporters contribute their data with possible perturbations (through adding noise). By analyzing the data reporters' equilibrium decisions in Stage II, we show that given any fixed reporter set, only one data reporter with the most significant joint consideration of the social relationship and data correlation may add noise to his reported data. The rest of the data reporters will truthfully report their data. In Stage I, we derive the data collector's optimal privacy-preserving mechanism and propose an efficient algorithm to select the data reporters. We conclude that the data collector should jointly capture the impact of data correlation and social relation to ensure all data reporters truthfully reporting their data. We conduct extensive simulations based on random network and real-world social data to investigate the impact of data correlation and social network on the system. We find that the availability of social network information is more critical to the data collector compared with data correlation information.\",\"PeriodicalId\":375932,\"journal\":{\"name\":\"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3209582.3209584\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3209582.3209584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Social-Aware Privacy-Preserving Correlated Data Collection
We study a privacy-preserving data collection problem, by jointly considering data reporters' data correlation and social relationship. A data collector gathers data from individuals to perform a certain analysis with a privacy-preserving mechanism. Due to data correlation, the data analysis based on the reported data can cause privacy leakage to other individuals (even if they do not report data). The data reporters will take such a privacy threat into account, owing to the social relationship among individuals. This motivates us to formulate a two-stage Stackelberg game: In Stage I, the data collector selects some individuals as data reporters and designs a privacy-preserving mechanism for a sum query analysis. In Stage II, the selected data reporters contribute their data with possible perturbations (through adding noise). By analyzing the data reporters' equilibrium decisions in Stage II, we show that given any fixed reporter set, only one data reporter with the most significant joint consideration of the social relationship and data correlation may add noise to his reported data. The rest of the data reporters will truthfully report their data. In Stage I, we derive the data collector's optimal privacy-preserving mechanism and propose an efficient algorithm to select the data reporters. We conclude that the data collector should jointly capture the impact of data correlation and social relation to ensure all data reporters truthfully reporting their data. We conduct extensive simulations based on random network and real-world social data to investigate the impact of data correlation and social network on the system. We find that the availability of social network information is more critical to the data collector compared with data correlation information.