社交网络中保护隐私的接近检测方法

Qiuling Chen, Ayong Ye, Li Xu
{"title":"社交网络中保护隐私的接近检测方法","authors":"Qiuling Chen, Ayong Ye, Li Xu","doi":"10.1145/2896387.2900320","DOIUrl":null,"url":null,"abstract":"Proximity detection is a fundamental service in social network. Most of traditional proximity detection methods need users' locations for location server to find their neighbors by calculating relative distance among them. However, this mechanism has caused similarly serious concerns on the potential privacy leakage if server is untrusted. To solve this problem, we propose a proximity detection method which is based on wireless APs (Access Point). Each request user only needs to submit a nearby AP list to social network server, which called SNS in this paper. After that, the SNS finds neighbors of request users by judging whether their nearby AP lists have a common item. In addition, since most existing APs may be uneven distribution and have risks of the location leakage, we also present a distributed Beacon Node Rotating Mechanism---each user acts as a beacon node, which is similar to AP to be a reference of neighbor discovery in proximity detection. Our method works well without requiring user's location information, which enhances the security of location privacy. Finally, we experimentally demonstrate the effectiveness and feasibility of the method.","PeriodicalId":342210,"journal":{"name":"Proceedings of the International Conference on Internet of things and Cloud Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A privacy-preserving Proximity Detection Method in social network\",\"authors\":\"Qiuling Chen, Ayong Ye, Li Xu\",\"doi\":\"10.1145/2896387.2900320\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proximity detection is a fundamental service in social network. Most of traditional proximity detection methods need users' locations for location server to find their neighbors by calculating relative distance among them. However, this mechanism has caused similarly serious concerns on the potential privacy leakage if server is untrusted. To solve this problem, we propose a proximity detection method which is based on wireless APs (Access Point). Each request user only needs to submit a nearby AP list to social network server, which called SNS in this paper. After that, the SNS finds neighbors of request users by judging whether their nearby AP lists have a common item. In addition, since most existing APs may be uneven distribution and have risks of the location leakage, we also present a distributed Beacon Node Rotating Mechanism---each user acts as a beacon node, which is similar to AP to be a reference of neighbor discovery in proximity detection. Our method works well without requiring user's location information, which enhances the security of location privacy. Finally, we experimentally demonstrate the effectiveness and feasibility of the method.\",\"PeriodicalId\":342210,\"journal\":{\"name\":\"Proceedings of the International Conference on Internet of things and Cloud Computing\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Conference on Internet of things and Cloud Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2896387.2900320\",\"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 International Conference on Internet of things and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2896387.2900320","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

接近检测是社交网络中的一项基本服务。传统的邻近检测方法大多需要用户的位置,位置服务器通过计算用户与用户之间的相对距离来找到用户的邻居。然而,这种机制也引起了类似的严重问题,即如果服务器不受信任,可能会泄露隐私。为了解决这一问题,我们提出了一种基于无线接入点(ap)的接近检测方法。每个请求用户只需要向社交网络服务器提交一个附近的AP列表,本文称之为SNS。之后,SNS通过判断请求用户附近的AP列表中是否有共同的项目,找到请求用户的邻居。此外,由于现有的大多数AP可能分布不均匀,存在位置泄漏的风险,我们还提出了一种分布式信标节点旋转机制——每个用户都充当一个信标节点,类似于AP,作为邻近检测中邻居发现的参考。该方法不需要用户的位置信息,提高了位置隐私的安全性。最后,通过实验验证了该方法的有效性和可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A privacy-preserving Proximity Detection Method in social network
Proximity detection is a fundamental service in social network. Most of traditional proximity detection methods need users' locations for location server to find their neighbors by calculating relative distance among them. However, this mechanism has caused similarly serious concerns on the potential privacy leakage if server is untrusted. To solve this problem, we propose a proximity detection method which is based on wireless APs (Access Point). Each request user only needs to submit a nearby AP list to social network server, which called SNS in this paper. After that, the SNS finds neighbors of request users by judging whether their nearby AP lists have a common item. In addition, since most existing APs may be uneven distribution and have risks of the location leakage, we also present a distributed Beacon Node Rotating Mechanism---each user acts as a beacon node, which is similar to AP to be a reference of neighbor discovery in proximity detection. Our method works well without requiring user's location information, which enhances the security of location privacy. Finally, we experimentally demonstrate the effectiveness and feasibility of the method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信