{"title":"利用用户服务灵活性的多用户隐私合作博弈","authors":"Shu Hong, Lingjie Duan","doi":"10.1109/ISIT50566.2022.9834703","DOIUrl":null,"url":null,"abstract":"In location-based services (LBSs), it is promising for multiple users to cache and share their Point-of-Interest (PoI) information with each other to reduce overall query frequency and preserve location privacy. Yet most studies on multi-user privacy preservation overlook the opportunity of leveraging service flexibility, where many users are flexible and may add obfuscation to individual LBS query. This paper is the first to study how multiple users cooperate to query with obfuscation against the adversary’s optimal inference attack, by leveraging their mutual service flexibility. Unlike the literature, even if a user already finds the shared PoI information useful, we prove it beneficial for him to further query with obfuscated location to confuse the adversary. To save the computational complexity of the max-min adversarial game problem and derive the closed-form solution, we also propose a binary approximate solution, which is proved to guarantee good privacy performance for an average user. Perhaps surprisingly, the user with greater service flexibility should choose to query the LBS with less misreported location, to maximally confuse the adversary. Finally, we numerically compare our optimal and approximate solutions with the existing approaches to show our effective privacy improvement.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-user Privacy Cooperation Game by Leveraging Users’ Service Flexibility\",\"authors\":\"Shu Hong, Lingjie Duan\",\"doi\":\"10.1109/ISIT50566.2022.9834703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In location-based services (LBSs), it is promising for multiple users to cache and share their Point-of-Interest (PoI) information with each other to reduce overall query frequency and preserve location privacy. Yet most studies on multi-user privacy preservation overlook the opportunity of leveraging service flexibility, where many users are flexible and may add obfuscation to individual LBS query. This paper is the first to study how multiple users cooperate to query with obfuscation against the adversary’s optimal inference attack, by leveraging their mutual service flexibility. Unlike the literature, even if a user already finds the shared PoI information useful, we prove it beneficial for him to further query with obfuscated location to confuse the adversary. To save the computational complexity of the max-min adversarial game problem and derive the closed-form solution, we also propose a binary approximate solution, which is proved to guarantee good privacy performance for an average user. Perhaps surprisingly, the user with greater service flexibility should choose to query the LBS with less misreported location, to maximally confuse the adversary. Finally, we numerically compare our optimal and approximate solutions with the existing approaches to show our effective privacy improvement.\",\"PeriodicalId\":348168,\"journal\":{\"name\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT50566.2022.9834703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT50566.2022.9834703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-user Privacy Cooperation Game by Leveraging Users’ Service Flexibility
In location-based services (LBSs), it is promising for multiple users to cache and share their Point-of-Interest (PoI) information with each other to reduce overall query frequency and preserve location privacy. Yet most studies on multi-user privacy preservation overlook the opportunity of leveraging service flexibility, where many users are flexible and may add obfuscation to individual LBS query. This paper is the first to study how multiple users cooperate to query with obfuscation against the adversary’s optimal inference attack, by leveraging their mutual service flexibility. Unlike the literature, even if a user already finds the shared PoI information useful, we prove it beneficial for him to further query with obfuscated location to confuse the adversary. To save the computational complexity of the max-min adversarial game problem and derive the closed-form solution, we also propose a binary approximate solution, which is proved to guarantee good privacy performance for an average user. Perhaps surprisingly, the user with greater service flexibility should choose to query the LBS with less misreported location, to maximally confuse the adversary. Finally, we numerically compare our optimal and approximate solutions with the existing approaches to show our effective privacy improvement.