|
|
Anonymity level adaptation algorithm to meet resource constraint of K-anonymity service in LBS |
YANG Zhao-hui1, LI Shan-ping1, LIN Xin1,2 |
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 A limitation in current design of K-anonymity services for location based services (LBS) is that they only provide a given minimum level of anonymity as QoS guarantee and can’t improve the anonymity level for users when service resources are capable. The anonymous query result size was proposed as a new QoS target in order to measure and constrain resource consumption on the K-anonymity service and LBS per user query. Then appropriate anonymity level can be selected under such constraint. Theoretical analysis was performed to find mathematical relation between anonymous query result size and anonymity level, leading to the construction of anonymity level adaptation algorithm. The simulation results accorded well with the theoretical relation. The anonymity level adaptation algorithm can control anonymous query result size to stay around the specified QoS target.
|
Published: 01 July 2011
|
|
LBS中面向K-匿名服务资源约束的匿名度调节算法
针对基于位置的服务(LBS)中的K-匿名机制以固定的最小匿名度为服务质量(QoS)指标,不能在计算资源允许的条件下为用户提供更高匿名度的问题,提出定义新的QoS指标——匿名结果集势指标R*,用于度量和约束匿名服务和LBS为用户的每次查询所平均消耗的计算资源,在此约束下选择可接受的匿名度. 从理论上分析匿名结果集势与匿名度的估算函数关系,据此构造相应的匿名度调节算法. 模拟实验的结果与上述理论函数关系吻合很好,证明本文的匿名度调节算法能够将匿名结果集势约束在给定值附近,实现了定义的QoS指标.
|
|
[1] GEDIK B, LIU L. Location privacy in mobile systems: a personalized anonymization model [C] ∥ Proceedings of the 25th International Conference on Distributed Computing Systems. Columbus: IEEE, 2005: 620-629. [2] MOKBEL M, CHOW C, AREF W. The new Casper: query processing for location services without compromising privacy [C] ∥ Proceedings of the 32nd International Conference on Very Large Data Bases. Seoul, Korea: VLDB Endowment, 2006: 763-774. [3] KALNIS P, GHINITA G, MOURATIDIS K, et al. Preventing locationbased identity inference in anonymous spatial queries [J]. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(12): 1719-1733. [4] CHOW C, MOKBEL M, LIU X. A peertopeer spatial cloaking algorithm for anonymous locationbased service [C] ∥ Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems: Arlington: ACM, 2006: 171-178. [5] GHINITA G, KALNIS P, SKIADOPOULOS S. PRIVE: anonymous locationbased queries in distributed mobile systems [C] ∥ Proceedings of the 16th International Conference on World Wide Web. Banff: ACM, 2007: 371-380. [6] 林欣,李善平,杨朝晖. LBS中连续查询攻击算法及匿名性度量 [J]. 软件学报, 2009, 20(4): 1058-1068. LIN Xin, LI Shanping, YANG Zhaohui. Attacking algorithms against continuous queries in LBS and anonymity measurement [J]. Journal of Software, 2009, 20(4): 1058-1068. [7] XU J, TANG X, HU H, et al. Privacyconscious locationbased queries in mobile environments [J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(3): 313-326. [8] HU H, LEE D. Range nearestneighbor query [J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(1): 78-91. [9] CHEN J, CHENG R. Efficient evaluation of imprecise locationdependent queries[C] ∥ Proceedings of IEEE 23rd International Conference on Data Engineering. Istanbul: IEEE, 2007: 586-595. [10] TAO Y, PAPADIAS D, SHEN Q. Continuous nearest neighbor search. [C] ∥ Proceedings of the 28th International Conference on Very Large Data Bases. Hong Kong, China: VLDB Endowment, 2002: 287-298. [11] BRINKHOFF T. A framework for generating networkbased moving objects [J]. Geoinformatica, 2002, 6(2): 153-180. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|