首页 | 本学科首页   官方微博 | 高级检索  
     

LBS 中连续查询攻击算法及匿名性度量
引用本文:林欣,李善平,杨朝晖.LBS 中连续查询攻击算法及匿名性度量[J].软件学报,2009,20(4):1058-1068.
作者姓名:林欣  李善平  杨朝晖
作者单位:1. 浙江大学,计算机学院,浙江,杭州,310027;华东师范大学,信息科学与技术学院,上海,200241
2. 浙江大学,计算机学院,浙江,杭州,310027
基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60473052, 60773180 (国家自然科学基金); theNatural Science Foundation of Zhejiang Province of China under Grant No.Y106427 (浙江省自然科学基金); the Int’l ScientificCollaborate Foundation of Shanghai of China under Grant No.075107006 (上海市国际科技合作基金)
摘    要:k-匿名机制是LBS(location based service)中保证查询隐私性的重要手段.已有文献指出,现有的k-匿名机 制不能有效保护连续性查询的隐私性.提出一种连续查询发送模型,该模型融合了查询发送时间的间隔模型和连续性模型,针对此模型下的两种k-匿名算法Clique Cloaking 和Non-clique Cloaking,分别提出了一种连续查询攻击算 法.在此攻击算法下,匿名集的势不再适合作为查询匿名性的度量,因此提出一种基于熵理论的度量方式AD(anonymity degree).实验结果表明,对连续性很强的查询,攻击算法重识别用户身份的成功率极高;AD 比匿名集的势更能反映查询的匿名性.

关 键 词:k-匿名  连续查询  攻击算法  匿名性度量
收稿时间:2007/12/8 0:00:00
修稿时间:2008/8/11 0:00:00

Attacking Algorithms Against Continuous Queries in LBS and Anonymity Measurement
LIN Xin,LI Shan-Ping and YANG Zhao-Hui.Attacking Algorithms Against Continuous Queries in LBS and Anonymity Measurement[J].Journal of Software,2009,20(4):1058-1068.
Authors:LIN Xin  LI Shan-Ping and YANG Zhao-Hui
Affiliation:College of Computer and Science;Zhejiang University;Hangzhou 310027;China;School of Information Science and Technology;East China Normal University;Shanghai 200241;China
Abstract:k-Anonymity is an important solution to protecting privacy of queries in LBS (location-based service).However, it is pointed out in literatures that k-anonymity cannot protect privacy of continuous queries effectively. Acontinuous query issuing model is proposed, which incorporates a query issuing interval model and a consecutivequeries relationship model. Under this continuous query issuing model, two attacking algorithms are proposed forClique Cloaking and Non-clique Cloaking respectively. Then this paper argues that the cardinality of anonymity-setis not a good anonymity measurement under such attack and an entropy-based anonymity measurement AD(anonymity degree) is proposed. Experimental results demonstrate that the attacking algorithms have high successrate in identifying query senders when the consecutive queries have strong relationship, and that AD is a betteranonymity measurement than the cardinality of anonymity-set.
Keywords:LBS(loeation-based service)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号