LBS 中连续查询攻击算法及匿名性度量
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

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 (上海市国际科技合作基金)


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

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    k-匿名机制是LBS(location based service)中保证查询隐私性的重要手段.已有文献指出,现有的k-匿名机 制不能有效保护连续性查询的隐私性.提出一种连续查询发送模型,该模型融合了查询发送时间的间隔模型和连续性模型,针对此模型下的两种k-匿名算法Clique Cloaking 和Non-clique Cloaking,分别提出了一种连续查询攻击算 法.在此攻击算法下,匿名集的势不再适合作为查询匿名性的度量,因此提出一种基于熵理论的度量方式AD(anonymity degree).实验结果表明,对连续性很强的查询,攻击算法重识别用户身份的成功率极高;AD 比匿名集的势更能反映查询的匿名性.

    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.

    参考文献
    相似文献
    引证文献
引用本文

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

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2007-12-08
  • 最后修改日期:2008-08-11
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号