基于加权最小二乘的社交网络用户定位方法

doi:10.11959/j.issn.2096-109x.2022031

网络与信息安全学报 ›› 2022, Vol. 8 ›› Issue (3): 41-52.doi: 10.11959/j.issn.2096-109x.2022031

• 专栏：多媒体内容安全 • 上一篇下一篇

基于加权最小二乘的社交网络用户定位方法

时文旗¹^,², 罗向阳¹^,², 郭家山¹^,³

¹ 网络空间态势感知河南省重点实验室，河南郑州 450001
² 数学工程与先进计算国家重点实验室，河南郑州 450001
³ 郑州大学网络空间安全学院，河南郑州 450001

修回日期:2022-05-05 出版日期:2022-06-15 发布日期:2022-06-01
作者简介:时文旗（1993− ），男，河南周口人，网络空间态势感知河南省重点实验室博士生，主要研究方向为网络目标定位、网络空间资源测绘
罗向阳（1978− ），男，湖北荆门人，网络空间态势感知河南省重点实验室教授、博士生导师，主要研究方向为网络空间资源测绘、多媒体安全
郭家山（1998− ），男，河南郑州人，网络空间态势感知河南省重点实验室硕士生，主要研究方向为网络空间资源测绘
基金资助:
国家自然科学基金(1804263);国家自然科学基金(1736214);国家自然科学基金(62172435);国家自然科学基金(62002386);中原科技创新领军人才计划(214200510019)

Social network user geolocating method based on weighted least squares

Wenqi SHI¹^,², Xiangyang LUO¹^,², Jiashan GUO¹^,³

¹ Key Laboratory of Cyberspace Situation Awareness of Henan Province, Zhengzhou 450001, China
² State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China
³ School of Cyber Science and Engineering, Zhengzhou University, Zhengzhou 450001, China

Revised:2022-05-05 Online:2022-06-15 Published:2022-06-01
Supported by:
The National Natural Science Foundation of China(1804263);The National Natural Science Foundation of China(1736214);The National Natural Science Foundation of China(62172435);The National Natural Science Foundation of China(62002386);Zhongyuan Science and Technology Innovation Leading Talent Project(214200510019)

摘要/Abstract

摘要：

社交网络在提供位置交友等服务时，会对展示的用户距离文本进行混淆处理，以保护用户位置隐私。为了验证当前社交网络采用的位置混淆机制能否有效保护用户的精确位置不被泄露，提出了一种基于加权最小二乘的社交网络用户定位方法。该方法构造测试环境，对位置交友服务中混淆后的距离文本进行大量搜集和统计，结合真实距离数据识别报告距离对应的真实距离边界；基于对目标用户所处坐标系象限的判别，优化探针位置部署，并利用三边测量定位模型得到目标用户的多个初步位置估计；基于估计位置与探针的距离关系，分别确定目标用户相较各探针的最远距离和最近距离的权重，从而构造目标函数并基于加权最小二乘求目标函数的最优解，该最优解即目标用户的最终定位结果。该方法基于距离边界约束推断社交用户位置，避免了对位置服务的频繁查询，保证了对社交用户的定位效率。基于微信平台开展了社交用户定位实验，对500个微信用户的实际定位结果表明，该方法能够实现对微信“附近的人”用户的准确定位，与现有基于空间划分、基于启发式数论等典型定位方法相比，定位精度和效率均有更好的性能表现，平均定位误差降低了10%以上，定位过程中的位置服务访问次数减少了50%以上。

关键词: 社交网络, 位置隐私, 用户定位, 权最小二乘

Abstract:

When providing location-based dating and other location-based services, social networks will confuse the displayed user distance text to protect the user’s location privacy.In order to verify whether the current location confusion mechanism adopted by social networks can effectively protect user’s accurate location, a social network user geolocating method based on weighted least squares was proposed.The method constructed real-world tests to collect a large number of confused distance texts in location dating service, and identified the real distance boundary of reported distance combined with real distance data.Then, based on the discrimination of the quadrant of the coordinate system where the target user was located, the position of probes was optimally deployed, and multiple preliminary position estimations of the target user were obtained by using the trilateration model.The weights of the longest and the shortest distance of the target user were determined by the estimated position, and the related objective function was constructed.The optimal solution of the objective function was calculated based on the weighted least squares, which was the final geolocating result of the target user.The proposed method inferred the location of social network user based on the distance boundary constraint, which avoided the frequent query of location services and ensured the geolocating efficiency.The actual geolocating results based on 500 WeChat users showed that, the proposed method can accurately geolocate the “eople nearby” users of WeChat.Compared with the existing typical geolocating methods based on space partition and heuristic number theory, the proposed method have better performance in geolocating accuracy and efficiency.The average geolocating error is reduced by more than 10%, and the number of location service quarries in the geolocating process is reduced by more than 50%.

Key words: social network, location privacy, user positioning, weighted least squares

中图分类号:

TP309

时文旗, 罗向阳, 郭家山. 基于加权最小二乘的社交网络用户定位方法[J]. 网络与信息安全学报, 2022, 8(3): 41-52.

Wenqi SHI, Xiangyang LUO, Jiashan GUO. Social network user geolocating method based on weighted least squares[J]. Chinese Journal of Network and Information Security, 2022, 8(3): 41-52.

图/表 11

图1

图2

图3

图4

图5

表1

表2

图6

图7

图8

图9

参考文献 24

[1]	姚瑞欣, 李晖, 曹进 ,等. 社交网络中的隐私保护研究综述[J]. 网络与信息安全学报, 2016,2(4): 33-43.
	YAO R X , LI H , CAO J ,et al. Overview of privacy preserving in social network[J]. Chinese Journal of Network and Information Security, 2016,2(4): 33-43.
[2]	李宇溪, 周福才, 徐紫枫 . 支持 K-近邻搜索的移动社交网络隐私保护方案[J]. 计算机学报, 2021,44(7): 1481-1500.
	LI Y X , ZHOU F C , XU Z F . Pravacy-preserving K-nearst-neighbor search over mobile social network[J]. Chinese Journal of Computer, 2021,44(7): 1481-1500.
[3]	ZHENG Y . Location-based social networks:users[M]. Springer,New York, 2011.
[4]	LI J , YAN H , LIU Z ,et al. Location-sharing systems with enhanced privacy in mobile online social networks[J]. IEEE Systems Journal, 2017,11(2): 439-448.
[5]	WANG H , LI Y , YANG C ,et al. Co-location social networks:linking the physical world and cyberspace[J]. IEEE Transactions on Mobile Computing, 2016,18(5): 1028-1041.
[6]	XIE R , CHEN Y , LIN S ,et al. Understanding skout users' mobility patterns on a global scale:a data-driven study[J]. World Wide Web, 2018,22(1): 2655-2673.
[7]	NOVAK E , LI Q . Near-pri:private,proximity based location sharing[C]// 33rd IEEE Conference on Computer Communications. 2014: 37-45.
[8]	LUO X , QIAO Y , LI C ,et al. An overview of microblog user geolocation methods[J]. Information Processing ＆ Management, 2020,57(6): 102375-102392.
[9]	ZHENG X , HAN J , SUN A . A survey of location prediction on Twitter[J]. IEEE Transactions on Knowledge and Data Engineering, 2017,30(9): 1-11.
[10]	ABHINAV K , JYOTI P . Location reference identification from tweets during emergencies:a deep learning approach[J]. International Journal of Disaster Risk Reduction, 2019,2(33): 365-375.
[11]	PUTTASWAMY K , WANG S , STEINBAUER T ,et al. Preserving location privacy in geosocial applications[J]. IEEE Transactions on Mobile Computing, 2014,13(1): 159-173.
[12]	DING, Y. , PEDDINTI, S.T. , ROSS, K.W . Stalking Beijing from Timbuktu:a generic measurement approach for exploiting location-based social discovery[C]// 4th ACM Workshop on Security and Privacy in Smartphones ＆ Mobile Devices. 2014: 75-80.
[13]	LI M , ZHU H , GAO Z ,et al. All your location are belong to us:breaking mobile social networks for automated user location tracking[C]// 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2014: 43-52.
[14]	CHENG H , MAO S , XUE M ,et al. On the impact of location errors on localization attacks in location-based social network services[C]// 9th International Conference on Security,Privacy and Anonymity in Computation,Communication and Storage. 2016: 343-357.
[15]	SHI W , LUO X , ZHAO F ,et al. Geolocating a WeChat user based on the relation between reported and actual distance[J]. International Journal of Distributed Sensor Networks, 2018,14(4): 1-13.
[16]	XUE M , LIU Y , ROSS K ,et al. I know where you are:thwarting privacy protection in location-based social discovery services[C]// IEEE Conference on Computer Communications Workshops. 2015: 179-184.
[17]	PENG J , MENG Y , XUE M ,et al. Attacks and defenses in location-based social networks:a heuristic number theory approach[C]// 36th IEEE International Symposium on Security and Privacy in Social Networks and Big Data. 2015: 64-71.
[18]	POLAKIS I , ARGYROS G , PETSIOS T ,et al. Where's Wally?:precise user discovery attacks in location proximity services[C]// 22nd ACM SIGSAC Conference on Computer and Communications Security. 2015: 817-828.
[19]	MORIYA K , FUJIMOTO M , ARAKAWA Y ,et al. Effective trilateration-based in-door localization method utilizing active control of lighting devices[J]. Sensors Mater, 2020,32(2): 625-650.
[20]	LIU J , ZHANG Y , ZHAO F . Robust distributed node localization with error management[C]// 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing. 2006: 250-261.
[21]	LUENBERGER D , YE Y . Linear and nonlinear programming[M]. MA: Addison-Wesley, 1984.
[22]	Tencent Homepage[EB].
[23]	SIDDULA M , LI Y , CHENG X ,et al. Privacy-enhancing preferential LBS query for mobile social network users[J]. Wireless Communications and Mobile Computing, 2020(4): 1-13.
[24]	JIANG H , LI J , ZHAO P ,et al. Location privacy-preserving mechanisms in location-based services:A comprehensive survey[J]. ACM Computing Surveys, 2021,54(1): 1-36.

项目	设置
报告距离范围	100 m至900 m
目标数量	500
使用微信账号数量	10
实验区域	郑州市市区5 km×5 km的区域
测试轮数	50轮
数据条数	11 724
Δd	5m
目标发现过程中相邻探针间隔	400 m
平移距离σ	100 m
自动化工具	Appium
运行环境	Nox Player模拟器
最小二乘实现函数	Python/scipy/optimize/bfgs
多边形中心点求解	Python/shapely/intersection

报告距离	最小真实距离	最大真实距离	距离范围
100	0	205	205
200	35	260	225
300	125	405	280
400	240	515	275
500	335	585	250
600	430	715	285
700	495	825	330
800	630	940	310
900	685	1085	400

基于加权最小二乘的社交网络用户定位方法

Social network user geolocating method based on weighted least squares

在线阅读

pdf下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 11

参考文献 24

相关文章 15

Metrics

推荐阅读 0

[1]	陈赛特, 李卫海, 姚远志, 俞能海. 轻量级K匿名增量近邻查询位置隐私保护算法[J]. 网络与信息安全学报, 2023, 9(3): 60-72.
[2]	谢绒娜, 范晓楠, 袁琳, 郭子晨, 朱家玉, 史国振. 在线社交网络中延伸访问控制机制研究[J]. 网络与信息安全学报, 2021, 7(5): 123-131.
[3]	蒋忠元, 陈贤宇, 马建峰. 社交网络中的社团隐私研究综述[J]. 网络与信息安全学报, 2021, 7(2): 10-21.
[4]	张鑫,羌卫中,吴月明,邹德清,金海. 基于卷积神经网络恶意安卓应用行为模式挖掘[J]. 网络与信息安全学报, 2020, 6(6): 35-44.
[5]	王培,贾焰,李爱平,蒋千越. 基于DeepLink的社交网络去匿名方法[J]. 网络与信息安全学报, 2020, 6(4): 104-108.
[6]	赖慧彬,许力,曾雅丽,朱瑞. 基于椭圆曲线的ElGamal型位置隐私保护方案[J]. 网络与信息安全学报, 2020, 6(3): 30-38.
[7]	曲强,于洪涛,黄瑞阳. 基于注意力机制的社交垃圾文本检测方法[J]. 网络与信息安全学报, 2020, 6(1): 54-61.
[8]	曲强, 于洪涛, 黄瑞阳. 社交网络异常用户检测技术研究进展[J]. 网络与信息安全学报, 2018, 4(3): 13-23.
[9]	黄仁季,叶清,吴倩. 无线传感器网络节点位置隐私保护研究[J]. 网络与信息安全学报, 2017, 3(11): 59-67.
[10]	陈天柱,郭云川,牛犇,李凤华. 面向社交网络的访问控制模型和策略研究进展[J]. 网络与信息安全学报, 2016, 2(8): 1-9.
[11]	何建琼,田有亮,周凯. 可证明安全的社交网络隐私保护方案[J]. 网络与信息安全学报, 2016, 2(8): 62-67.
[12]	姚瑞欣,李晖,曹进. 社交网络中的隐私保护研究综述[J]. 网络与信息安全学报, 2016, 2(4): 33-43.
[13]	仝伟,毛云龙,陈庆军,王彬入,张保佳,仲盛. 抗大数据分析的隐私保护：研究现状与进展[J]. 网络与信息安全学报, 2016, 2(4): 44-55.
[14]	朱建明,高博. 社交金融的信息安全风险分析与防范[J]. 网络与信息安全学报, 2016, 2(3): 46-51.
[15]	闫峥,吴宸梓,冯伟,王子龙. 可信普适社交网络研究综述和展望[J]. 网络与信息安全学报, 2016, 2(2): 30-40.