LBS+中连续查询攻击算法与匿名性度量.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.20, No.4, April 2009, pp.1058− 1068 doi: 10.3724/SP.J.1001.2009.03428 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ LBS 中连续查询攻击算法及匿名性度量 1,2+ 1 1 林 欣 , 李善平 , 杨朝晖 1(浙江大学 计算机学院,浙江 杭州 310027) 2(华东师范大学 信息科学与技术学院,上海 200241) Attacking Algorithms Against Continuous Queries in LBS and Anonymity Measurement 1,2+ 1 1 LIN Xin , LI Shan-Ping , YANG Zhao-Hui 1(College of Computer and Science, Zhejiang University, Hangzhou 310027, China) 2(School of Information Science and Technology, East China Normal University, Shanghai 200241, China) + Corresponding author: E-mail: xlin@ Lin X, Li SP, Yang ZH. Attacking algorithms against continuous queries in LBS and anonymity measurement. Journal of Software, 2009,20(4):1058−1068. /1000-9825/3428.htm 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. A continuous query issuing model is proposed, which incorporates a query issuing interval model and a consecutive queries relationship model. Under this continuous query issuing model, two attacking algorithms are proposed for Clique Cloaking and Non-clique Cloaking respectively. Then this paper argues that the cardinality of anonymity-set is not a good anonymity measurement under such attack and an entropy-based anonymity measurement AD (anonymity degr