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 条
  • [1] Location K-anonymity in indoor spaces
    Joon-Seok Kim
    Ki-Joune Li
    GeoInformatica, 2016, 20 : 415 - 451
  • [2] A Distributed k-Anonymity Protocol for Location Privacy
    Zhong, Ge
    Hengartner, Urs
    2009 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM), VOLS 1 AND 2, 2009, : 253 - 262
  • [3] A Clustering K-Anonymity Scheme for Location Privacy Preservation
    Yao, Lin
    Wu, Guowei
    Wang, Jia
    Xia, Feng
    Lin, Chi
    Wang, Guojun
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2012, E95D (01): : 134 - 142
  • [4] k-Anonymity Location Privacy Algorithm Based on Clustering
    Zheng, Lijuan
    Yue, Huanhuan
    Li, Zhaoxuan
    Pan, Xiao
    Wu, Mei
    Yang, Fan
    IEEE ACCESS, 2018, 6 : 28328 - 28338
  • [5] Truthful Incentive Mechanisms for K-Anonymity Location Privacy
    Yang, Dejun
    Fang, Xi
    Xue, Guoliang
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 2994 - 3002
  • [6] Nonexposure Accurate Location K-Anonymity Algorithm in LBS
    Jia, Jinying
    Zhang, Fengli
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [7] A K-Anonymity Based Schema for Location Privacy Preservation
    Fei, Fan
    Li, Shu
    Dai, Haipeng
    Hu, Chunhua
    Dou, Wanchun
    Ni, Qiang
    IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, 2019, 4 (02): : 156 - 167
  • [8] Analysis of k-Anonymity Algorithms for Streaming Location Data
    Andrews, Matthew
    Wilfong, Gordon
    Zhang, Lisa
    2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2015, : 692 - 697
  • [9] Dummy Location Selection Scheme for K-anonymity in Location based Services
    Wu, Di
    Zhang, Yu
    Liu, Yinlong
    2017 16TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS / 11TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING / 14TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS, 2017, : 441 - 448
  • [10] Multirelational k-Anonymity
    Nergiz, Mehmet Ercan
    Clifton, Christopher
    Nergiz, Ahmet Erhan
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (08) : 1104 - 1117