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 Journal/MagazineJournal articlepeer-review

Published

Standard

A K-Anonymity Based Schema for Location Privacy Preservation. / Fei, Fan; Li, Shu; Dai, Haipeng et al.

In: IEEE Transactions on Sustainable Computing, Vol. 4, No. 2, 01.04.2019, p. 156-167.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Fei, F, Li, S, Dai, H, Hu, C, Dou, W & Ni, Q 2019, 'A K-Anonymity Based Schema for Location Privacy Preservation', IEEE Transactions on Sustainable Computing, vol. 4, no. 2, pp. 156-167. https://doi.org/10.1109/TSUSC.2017.2733018

APA

Fei, F., Li, S., Dai, H., Hu, C., Dou, W., & Ni, Q. (2019). A K-Anonymity Based Schema for Location Privacy Preservation. IEEE Transactions on Sustainable Computing, 4(2), 156-167. https://doi.org/10.1109/TSUSC.2017.2733018

Vancouver

Fei F, Li S, Dai H, Hu C, Dou W, Ni Q. A K-Anonymity Based Schema for Location Privacy Preservation. IEEE Transactions on Sustainable Computing. 2019 Apr 1;4(2):156-167. Epub 2017 Jul 28. doi: 10.1109/TSUSC.2017.2733018

Author

Fei, Fan ; Li, Shu ; Dai, Haipeng et al. / A K-Anonymity Based Schema for Location Privacy Preservation. In: IEEE Transactions on Sustainable Computing. 2019 ; Vol. 4, No. 2. pp. 156-167.

Bibtex

@article{f80b38e6a9f94c498247b061d91fc1f4,
title = "A K-Anonymity Based Schema for Location Privacy Preservation",
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.",
keywords = "LBS, privacy preservation, k-anonymity, auction",
author = "Fan Fei and Shu Li and Haipeng Dai and Chunhua Hu and Wanchun Dou and Qiang Ni",
note = "{\textcopyright}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.",
year = "2019",
month = apr,
day = "1",
doi = "10.1109/TSUSC.2017.2733018",
language = "English",
volume = "4",
pages = "156--167",
journal = "IEEE Transactions on Sustainable Computing",
issn = "2377-3782",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

RIS

TY - JOUR

T1 - A K-Anonymity Based Schema for Location Privacy Preservation

AU - Fei, Fan

AU - Li, Shu

AU - Dai, Haipeng

AU - Hu, Chunhua

AU - Dou, Wanchun

AU - Ni, Qiang

N1 - ©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.

PY - 2019/4/1

Y1 - 2019/4/1

N2 - 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.

AB - 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.

KW - LBS

KW - privacy preservation

KW - k-anonymity

KW - auction

U2 - 10.1109/TSUSC.2017.2733018

DO - 10.1109/TSUSC.2017.2733018

M3 - Journal article

VL - 4

SP - 156

EP - 167

JO - IEEE Transactions on Sustainable Computing

JF - IEEE Transactions on Sustainable Computing

SN - 2377-3782

IS - 2

ER -