Please wait a minute...
浙江大学学报(工学版)
J4  2009, Vol. 43 Issue (12): 2136-2141    DOI: 10.3785/j.issn.1008-973X.2009.12.002
自动化技术、计算机技术     
一种针对LBS中k-匿名连续查询的攻击算法
林欣1,2,李善平1,杨朝晖1
（1.浙江大学 计算机科学与技术学院,浙江 杭州 310027；2. 华东师范大学 计算机科学技术系, 上海 200241）　　
Attacking algorithm against  k-anonymized continuous queries in location based service
LIN Xin1,2, LI Shan-ping1, YANG Zhao-hui1
(1. College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China；
2. Department of Computer Science and Technology, East China Normal University, Shanghai  200241, China)
 全文: PDF(951 KB)   HTML
摘要：

针对k-匿名机制无法保证位置信息服务（LBS）中连续查询隐私性的问题,提出一种连续查询发送模型,该模型融合了查询发送时间的间隔模型和连续性模型.在该模型的基础上针对k-匿名算法,提出一种连续查询攻击算法,该算法将和连续查询相关的一系列快照互相关联,计算出快照的匿名集内每个用户发送查询的概率,从而估计出查询真正的发送者.仿真实验模拟在不同的连续性参数、匿名集的势的情况下,使用连续查询攻击算法重识别受k-匿名保护的查询.通过对被恶意攻击者重识别的查询数量统计,结果表明,对连续性很强的查询,攻击算法重识别用户身份的成功率极高（85%）,比不使用攻击算法所获得的重识别率提高了1.5倍以上,严重破坏了查询的匿名性.
Abstract:

K-anonymization cannot effectively protect anonymity of continuous queries in location-based service (LBS). A continuous query issuing model aimed at the problem was proposed. The model incorporated a query issuing interval model and a consecutive queries relationship model. An attacking algorithm aimed at the k-anonymization algorithm  was presented based on the model. The algorithm associated a series of snapshots related to continuous queries in order to calculate the probability of each user in the anonymity-set. Then the true query sender was identified by choosing the user with the highest probability. K-anonymized queries were re-identified with different continuity arguments and cardinalities of anonymity-set. Experiments demonstrate that the algorithm has high success rate (85%)in identifying query senders when the continuous queries have strong relationship, which is 1.5 times higher than the success rate without the attacking algorithm and severely undermines the anonymity of the queries.
出版日期: 2010-01-16
:  TP 393  
基金资助:

国家自然科学基金资助项目（60473052，60773180，60903169 ）；浙江省自然科学基金资助项目（Y106427）.
通讯作者: 李善平，男，教授.     E-mail: shan@cs.zju.edu.cn
作者简介: 林欣（1981-）, 男， 福建福州人,博士生，从事普适计算、LBS中的隐私性方面的研究.
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　

引用本文:

林欣, 李善平, 杨朝晖. 一种针对LBS中k-匿名连续查询的攻击算法[J]. J4, 2009, 43(12): 2136-2141.

LIN Xin, LI Shan-Beng, YANG Chao-Hui. Attacking algorithm against  k-anonymized continuous queries in location based service. J4, 2009, 43(12): 2136-2141.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2009.12.002    或    http://www.zjujournals.com/eng/CN/Y2009/V43/I12/2136

[1] BISDIKIAN C, CHRISTENSEN J, DAVIS J, et al. Enabling location-based applications
[C] ∥1st Workshop on Mobile Commerce. Rome, Italy: ACM, 2001: 38-42.
[2] JOSE R, DAVIES N. Scalable and flexible location-based services for ubiquitous information access
[C] ∥Proceedings of First International Symposium on Hand-held and Ubiquitous Computing, HUC’99. Karlsruhe, Germany: Springer Verlag, 1999: 52-66.
[3] GRUTESER M,GRUNWALD D. Anonymous usage of location based services through spatial and temporal cloaking
[C] ∥ACM/USENIX Mobile Systems, Applications and Service.San Francisco, California, USA: ACM, 2003: 31-42.
[4] GEDIK B, LIU L. Location privacy in mobile systems: a personalized anonymization model
[C] ∥Proceedings of International Conference on Distributed Computing Systems. Columbus, Ohio, USA: IEEE, 2005: 620-629.
[5] GHINITA G, KALNIS P, SKIADOPOULOS S. PRIVE: anonymous location-based queries in distributed mobile systems
[C] ∥Proceedings of the International World Wide Web Conference. Banff, Canada: ACM, 2007: 371-380.
[6] CHOW C, MOKBEL M. Enabling private continuous queries for revealed user locations
[C] ∥Advances in Spatial and Temporal Databases. Boston, MA, USA: Springer Verlag, 2007: 258-275.
[7] MOHAMMAD R, KOLAHDOUZAN C S. Alternative solutions for continuous K nearest neighbor queries in spatial network databases
[J] GeoInformatica, 2005, 9(4):321-341.
[8] XIONG X, MOKBEL, AREF W. SEA-CNN: scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases
[C] ∥In Proceeding of the International Conference on Data Engineering. Tokyo: IEEE, 2005: 643-654.
[9] HUANG X, JENSEN C. Towards a streams-based framework for defining location-based queries
[C] ∥Proceedings of the International Workshop on Spatio-temporal Database Management. Toronto, Canada: ACM, 2004:73-80.
[10] MOKBEL M, AREF W. SOLE: scalable online execution of continuous queries on spatiotemporal data streams
[J] Journal on Very Large Database, 2008,17(5):971-995.
[11] BRINKHOFF T. A framework for generating network-based moving objects
[1] 郭童,林峰. 基于混合遗传鱼群算法的贝叶斯网络结构学习[J]. J4, 2014, 48(1): 130-135.
[2] 李德骏,汪港,杨灿军,金波,陈燕虎. 基于NTP和IEEE1588海底观测网时间同步系统[J]. J4, 2014, 48(1): 1-7.
[3] 杜瑞忠, 田俊峰, 张焕国. 基于信任和个性偏好的云服务选择模型[J]. J4, 2013, 47(1): 53-61.
[4] 张帅,孙建伶,徐斌,黄超,KAVS Aleksander J.. 基于RBAC的跨多企业服务组合访问控制模型[J]. J4, 2012, 46(11): 2035-2043.
[5] 陈岁生,卢建刚,楼晓春. 基于MDS-MAP和非线性滤波的WSN定位算法[J]. J4, 2012, 46(5): 866-872.
[6] 杨朝晖,李善平,林欣. 增量型上下文信息服务的质量优化实时调度[J]. J4, 2012, 46(1): 90-97.
[7] 潘巨龙,李善平,张道远. 无线传感器网络簇内可疑节点的博弈检测方法[J]. J4, 2012, 46(1): 72-78.
[8] 高庆,李善平,杨朝晖. 基于虚拟场的能量高效传感器网络地理路由[J]. J4, 2012, 46(1): 98-104.
[9] 钱剑锋, 尹建伟, 董金祥. 结构化P2P网络的语义发布/订阅系统
负载均衡算法[J]. J4, 2011, 45(10): 1710-1719.
[10] 杨朝晖,李善平,林欣. LBS中面向K-匿名服务资源约束的匿名度调节算法[J]. J4, 2011, 45(7): 1154-1160.
[11] 潘纲, 李石坚, 陈云星. ScudContext:信息-物理空间融合的大规模
环境上下文服务[J]. J4, 2011, 45(6): 991-998.
[12] 车建华, 何钦铭, 陈建海, 王备. 基于软件模拟的虚拟机系统故障插入工具[J]. J4, 2011, 45(4): 614-620.
[13] 张莉苹,潘纲,郑能干,杨国青,李红,赵民德. SmartC模型与代码一致性双向生成方法及开发平台[J]. J4, 2011, 45(1): 20-29.
[14] 李鉴庭,金心宇,唐军,张昱. 基于无线多媒体传感器网络的目标定位方法[J]. J4, 2011, 45(1): 45-49.
[15] 舒挺, 孙守迁,王海宁,徐伟强. ESIS序列自适应生成算法[J]. J4, 2010, 44(11): 2183-2187.