Please wait a minute...
J4  2011, Vol. 45 Issue (7): 1154-1160    DOI: 10.3785/j.issn.1008-973X.2011.07.003
计算机科学技术     
LBS中面向K-匿名服务资源约束的匿名度调节算法
杨朝晖1,李善平1,林欣1,2
1.浙江大学 计算机科学与技术学院, 浙江 杭州 310027;2.华东师范大学 计算机科学技术系, 上海 200241
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
 全文: PDF  HTML
摘要:

针对基于位置的服务(LBS)中的K-匿名机制以固定的最小匿名度为服务质量(QoS)指标,不能在计算资源允许的条件下为用户提供更高匿名度的问题,提出定义新的QoS指标——匿名结果集势指标R*,用于度量和约束匿名服务和LBS为用户的每次查询所平均消耗的计算资源,在此约束下选择可接受的匿名度. 从理论上分析匿名结果集势与匿名度的估算函数关系,据此构造相应的匿名度调节算法. 模拟实验的结果与上述理论函数关系吻合很好,证明本文的匿名度调节算法能够将匿名结果集势约束在给定值附近,实现了定义的QoS指标.

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.

出版日期: 2011-07-01
:  TP 393  
基金资助:

国家自然科学基金资助项目(60773180,60903169);上海市信息安全综合管理技术研究重点实验室开放课题资助项目(AGK2008004).

通讯作者: 李善平,男,教授.     E-mail: shan@zju.edu.cn
作者简介: 杨朝晖(1979-),男,博士生,从事上下文感知计算研究. E-mail:zhaohuiyang@zju.edu.cn
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
作者相关文章  

引用本文:

杨朝晖,李善平,林欣. LBS中面向K-匿名服务资源约束的匿名度调节算法[J]. J4, 2011, 45(7): 1154-1160.

YANG Zhao-hui, LI Shan-ping, LIN Xin. Anonymity level adaptation algorithm to meet resource constraint
of K-anonymity service in LBS. J4, 2011, 45(7): 1154-1160.

链接本文:

https://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2011.07.003        https://www.zjujournals.com/eng/CN/Y2011/V45/I7/1154

[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 locationbased 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 peertopeer spatial cloaking algorithm for anonymous locationbased 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 locationbased 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 Shanping, YANG Zhaohui. 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. Privacyconscious locationbased queries in mobile environments [J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(3): 313-326.
[8] HU H, LEE D. Range nearestneighbor query [J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(1): 78-91.
[9] CHEN J, CHENG R. Efficient evaluation of imprecise locationdependent 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 networkbased moving objects [J]. Geoinformatica, 2002, 6(2): 153-180.

[1] 李德骏,汪港,杨灿军,金波,陈燕虎. 基于NTP和IEEE1588海底观测网时间同步系统[J]. J4, 2014, 48(1): 1-7.
[2] 郭童,林峰. 基于混合遗传鱼群算法的贝叶斯网络结构学习[J]. J4, 2014, 48(1): 130-135.
[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): 72-78.
[7] 杨朝晖,李善平,林欣. 增量型上下文信息服务的质量优化实时调度[J]. J4, 2012, 46(1): 90-97.
[8] 高庆,李善平,杨朝晖. 基于虚拟场的能量高效传感器网络地理路由[J]. J4, 2012, 46(1): 98-104.
[9] 钱剑锋, 尹建伟, 董金祥. 结构化P2P网络的语义发布/订阅系统
负载均衡算法
[J]. J4, 2011, 45(10): 1710-1719.
[10] 潘纲, 李石坚, 陈云星. ScudContext:信息-物理空间融合的大规模
环境上下文服务
[J]. J4, 2011, 45(6): 991-998.
[11] 车建华, 何钦铭, 陈建海, 王备. 基于软件模拟的虚拟机系统故障插入工具[J]. J4, 2011, 45(4): 614-620.
[12] 张莉苹,潘纲,郑能干,杨国青,李红,赵民德. SmartC模型与代码一致性双向生成方法及开发平台[J]. J4, 2011, 45(1): 20-29.
[13] 李鉴庭,金心宇,唐军,张昱. 基于无线多媒体传感器网络的目标定位方法[J]. J4, 2011, 45(1): 45-49.
[14] 舒挺, 孙守迁,王海宁,徐伟强. ESIS序列自适应生成算法[J]. J4, 2010, 44(11): 2183-2187.
[15] 陈友荣, 俞立, 董齐芬, 洪榛. 基于近邻算法的无线传感器网络功率控制[J]. J4, 2010, 44(7): 1321-1326.