Home > Research > Publications & Outputs > A K-Anonymity Based Schema for Location Privacy...

Electronic data

  • 07995131 (1)

    Rights statement: ©2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 4.73 MB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

A K-Anonymity Based Schema for Location Privacy Preservation

Research output: Contribution to journalJournal article

Published
  • Fan Fei
  • Shu Li
  • Haipeng Dai
  • Chunhua Hu
  • Wanchun Dou
  • Qiang Ni
Close
<mark>Journal publication date</mark>1/04/2019
<mark>Journal</mark>IEEE Transactions on Sustainable Computing
Issue number2
Volume4
Number of pages12
Pages (from-to)156-167
Publication statusPublished
Early online date28/07/17
Original languageEnglish

Abstract

In recent years, with the development of mobile devices, the location based services (LBSs) have become more and more prevailing and most applications installed on these devices call for location information. Yet, the untrusted LBS provider can collect these location information, which may potentially threaten users' location privacy. In view of this challenge, we propose a two-tier schema for the privacy preservation based on k-anonymity principle meanwhile reduce the cost for privacy protection. Concretely, we divide the users into groups in order to maximize the privacy level and in each group one proxy is selected to generate dummy locations and share the returned results from LBS provider; then, on each group, an auction mechanism is proposed to determine the payment of each user to the proxy as the compensation, which satisfies budget balance and incentive compatibility. To evaluate the performance of the proposed schema, a simulated experiment is conducted.

Bibliographic note

©2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.