跳到主要导航 跳到搜索 跳到主要内容

Attacking algorithm against k-anonymized continuous queries in location based service

  • Xin Lin
  • , Shan Ping Li*
  • , Zhao Hui Yang
  • *此作品的通讯作者
  • Zhejiang University

科研成果: 期刊稿件文章同行评审

摘要

K-anonymization cannot effectively protect anonymity of continuous queries in location-based service (LBS). A continuous query issuing model aimed at the problem was proposed. The model incorporated a query issuing interval model and a consecutive queries relationship model. An attacking algorithm aimed at the k-anonymization algorithm was presented based on the model. The algorithm associated a series of snapshots related to continuous queries in order to calculate the probability of each user in the anonymity-set. Then the true query sender was identified by choosing the user with the highest probability. K-anonymized queries were re-identified with different continuity arguments and cardinalities of anonymity-set. Experiments demonstrate that the algorithm has high success rate (85%) in identifying query senders when the continuous queries have strong relationship, which is 1.5 times higher than the success rate without the attacking algorithm and severely undermines the anonymity of the queries.

源语言英语
页(从-至)2136-2141+2170
期刊Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science)
43
12
DOI
出版状态已出版 - 12月 2009

学术指纹

探究 'Attacking algorithm against k-anonymized continuous queries in location based service' 的科研主题。它们共同构成独一无二的学术指纹。

引用此