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