Attacking Algorithms Against Continuous Queries in LBS and Anonymity Measurement
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

林欣,李善平,杨朝晖. LBS 中连续查询攻击算法及匿名性度量.软件学报,2009,20(4):1058-1068

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 08,2007
  • Revised:August 11,2008
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063