Achieving the Optimal k-Anonymity for Content Privacy in Interactive Cyberphysical Systems

被引:0
|
作者
Wang, Jinbao [1 ]
Tian, Ling [2 ]
Huang, Yan [3 ]
Yang, Donghua [1 ]
Gao, Hong [4 ]
机构
[1] Harbin Inst Technol, Acad Fundamental & Interdisciplinary Sci, Harbin, Heilongjiang, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Comp Sci & Technol, Chengdu, Sichuan, Peoples R China
[3] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA
[4] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin, Heilongjiang, Peoples R China
基金
中国国家自然科学基金;
关键词
QUERY PRIVACY; PROTECTION;
D O I
10.1155/2018/7963163
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Modern applications and services leveraged by interactive cyberphysical systems (CPS) are providing significant convenience to our daily life in various aspects at present. Clients submit their requests including query contents to CPS servers to enjoy diverse services such as health care, automatic driving, and location-based services. However, privacy concerns arise at the same time. Content privacy is recognized and a lot of efforts have been made in the literature of privacy preserving in interactive cyberphysical systems such as location-based services. Nevertheless, neither the cloaking based solutions nor existing client based solutions have achieved effective content privacy by optimizing proper content privacy metrics. In this paper we formulate the problem of achieving the optimal content privacy in interactive cyberphysical systems using k-anonymity solutions based on two content privacy metrics, which are defined using the concepts of entropy and differential privacy. Then we propose an algorithm, Multilayer Alignment (MLA), to establish k-anonymity mechanisms for preserving content privacy in interactive cyberphysical systems. Our proposed MLA is theoretically proved to achieve the optimal content privacy in terms of both the entropy based and the differential privacy mannered content privacy metrics. Evaluation based on real-life datasets is conducted, and the evaluation results validate the effectiveness of our proposed algorithm.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] Achieving k-anonymity privacy protection using generalization and suppression
    Sweeney, L
    [J]. INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2002, 10 (05) : 571 - 588
  • [2] -diversity: Privacy beyond k-anonymity
    Cornell University
    不详
    [J]. ACM Trans. Knowl. Discov. Data, 2007, 1
  • [3] k-anonymity:: A model for protecting privacy
    Sweeney, L
    [J]. INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2002, 10 (05) : 557 - 570
  • [4] Achieving Effective k-Anonymity for Query Privacy in Location-Based Services
    Wang, Jinbao
    Li, Yingshu
    Yang, Donghua
    Gao, Hong
    Luo, Guangchun
    Li, Jianzhong
    [J]. IEEE ACCESS, 2017, 5 : 24580 - 24592
  • [5] LRM: A Location Recombination Mechanism for Achieving Trajectory k-Anonymity Privacy Protection
    Wang, Yunfeng
    Li, Mingzhen
    Luo, Shoushan
    Xin, Yang
    Zhu, Hongliang
    Chen, Yuling
    Yang, Guangcan
    Yang, Yixian
    [J]. IEEE ACCESS, 2019, 7 : 182886 - 182905
  • [6] Protecting privacy using k-anonymity
    El Emam, Khaled
    Dankar, Fida Kamal
    [J]. JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2008, 15 (05) : 627 - 637
  • [7] Achieving k-anonymity in Privacy-Aware Location-Based Services
    Niu, Ben
    Li, Qinghua
    Zhu, Xiaoyan
    Cao, Guohong
    Li, Hui
    [J]. 2014 PROCEEDINGS IEEE INFOCOM, 2014, : 754 - 762
  • [8] Enhanced p-Sensitive k-Anonymity Models for Achieving Better Privacy
    Wang, Nan
    Song, Haina
    Luo, Tao
    Sun, Jinkao
    Li, Jianfeng
    [J]. 2020 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), 2020, : 148 - 153
  • [9] A secure distributed framework for achieving k-anonymity
    Wei Jiang
    Chris Clifton
    [J]. The VLDB Journal, 2006, 15 : 316 - 333
  • [10] A secure distributed framework for achieving k-anonymity
    Jiang, Wei
    Clifton, Chris
    [J]. VLDB JOURNAL, 2006, 15 (04): : 316 - 333