Location K-anonymity in indoor spaces

被引:9
|
作者
Kim, Joon-Seok [1 ]
Li, Ki-Joune [1 ]
机构
[1] Pusan Natl Univ, Dept Comp Sci & Engn, Busan 609735, South Korea
关键词
Location K-anonymity; l-diversity; Privacy; Hierarchical graph; Indoor space; k-NN query; PRIVACY; ALGORITHM; SYSTEMS;
D O I
10.1007/s10707-015-0241-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the expansion of wireless-communication infrastructure and the evolution of indoor positioning technologies, the demand for location-based services (LBS) has been increasing in indoor as well as outdoor spaces. However, we should consider a significant challenge regarding the location privacy for realizing indoor LBS. To avoid violations of location privacy, much research has been performed, and location K-anonymity has been intensively studied to blur a user location with a cloaking region involving at least locations of other persons. Owing to the differences between indoor and outdoor spaces, it is, however, difficult to apply this approach directly in an indoor space. First, the definition of the distance metric in indoor space is different from that in Euclidean and road-network spaces. Second, a bounding region, which is a general form of an anonymizing spatial region (ASR) in Euclidean space, does not respect the locality property in indoor space, where movement is constrained by building components. Therefore, we introduce the concept of indoor location K-anonymity in this paper. Then, we investigate the requirements of ASR in indoor spaces and propose novel methods to determine the ASR, considering hierarchical structures of the indoor space. While indoor ASRs are determined at the anonymizer, we also propose processing methods for r-range queries and k-nearest-neighbor queries at a location-based service provider. We validate our methods with experimental analysis of query-processing performance and resilience against attacks in indoor spaces.
引用
收藏
页码:415 / 451
页数:37
相关论文
共 50 条
  • [41] A Distributed Location Trusted Service Achieving k-Anonymity against the Global Adversary
    Buccafurri, Francesco
    De Angelis, Vincenzo
    Idone, Maria Francesca
    Labrini, Cecilia
    2021 22ND IEEE INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT (MDM 2021), 2021, : 133 - 138
  • [42] A trusted de-swinging k-anonymity scheme for location privacy protection
    Yang, Manxiang
    Ye, Baopeng
    Chen, Yuling
    Li, Tao
    Yang, Yixian
    Qian, Xiaobin
    Yu, Xiaomei
    JOURNAL OF CLOUD COMPUTING-ADVANCES SYSTEMS AND APPLICATIONS, 2022, 11 (01):
  • [43] Achieving k-anonymity in Privacy-Aware Location-Based Services
    Niu, Ben
    Li, Qinghua
    Zhu, Xiaoyan
    Cao, Guohong
    Li, Hui
    2014 PROCEEDINGS IEEE INFOCOM, 2014, : 754 - 762
  • [44] A Game-Theoretic Approach for Achieving k-Anonymity in Location Based Services
    Liu, Xinxin
    Liu, Kaikai
    Guo, Linke
    Li, Xiaolin
    Fang, Yuguang
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 2985 - 2993
  • [45] -diversity: Privacy beyond k-anonymity
    Cornell University
    不详
    ACM Trans. Knowl. Discov. Data, 2007, 1
  • [46] On the complexity of restricted k-anonymity problem
    Sun, Xiaoxun
    Wang, Hua
    Li, Jiuyong
    PROGRESS IN WWW RESEARCH AND DEVELOPMENT, PROCEEDINGS, 2008, 4976 : 287 - +
  • [47] k-anonymity:: A model for protecting privacy
    Sweeney, L
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2002, 10 (05) : 557 - 570
  • [48] Toward inference attacks for k-anonymity
    Sun, Yan
    Yin, Lihua
    Liu, Licai
    Xin, Shuang
    PERSONAL AND UBIQUITOUS COMPUTING, 2014, 18 (08) : 1871 - 1880
  • [49] Risk & distortion based K-anonymity
    Xu, Shenkun
    Ye, Xiaojun
    INFORMATION SECURITY APPLICATIONS, 2007, 4867 : 345 - 358
  • [50] k-anonymity in databases with timestamped data
    Mascetti, Sergio
    Bettini, Claudio
    Wang, X. Sean
    Jajodia, Sushil
    TIME 2006: THIRTEENTH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS, 2006, : 177 - +