The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient algorithms for K-anonymous location privacy in participatory sensing
Abstract
Location privacy is an important concern in participatory sensing applications, where users can both contribute valuable information (data reporting) as well as retrieve (location-dependent) information (query) regarding their surroundings. K-anonymity is an important measure for privacy to prevent the disclosure of personal data. In this paper, we propose a mechanism based on locality-sensitive hashing (LSH) to partition user locations into groups each containing at least K users (called spatial cloaks). The mechanism is shown to preserve both locality and K-anonymity. We then devise an efficient algorithm to answer kNN queries for any point in the spatial cloaks of arbitrary polygonal shape. Extensive simulation study shows that both algorithms have superior performance with moderate computation complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
Cited by
TRAC: Truthful auction for location-aware collaborative sensing in mobile crowdsourcing
Feng, Z., Zhu, Y., Zhang, Q., Ni, L. M., & Vasilakos, A. V. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6848055 · Cited by 387
Spatial crowdsourcing: a survey
Tong, Y., Zhou, Z., Zeng, Y., Chen, L., & Shahabi, C. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00568-7 · Cited by 305
Efficient location privacy algorithm for Internet of Things (IoT) services and applications
Sun, G., Chang, V., Ramachandran, M., Sun, Z., Li, G., Yu, H., & Liao, D. (2017) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.10.011 · Cited by 159
A Dual Privacy Preserving Scheme in Continuous Location-Based Services
Zhang, S., Wang, G., Bhuiyan, M. Z. A., & Liu, Q. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2842470 · Cited by 159
A privacy-preserving sensory data sharing scheme in Internet of Vehicles
Kong, Q., Lu, R., Ma, M., & Bao, H. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2017.12.003 · Cited by 85
Metadata
- Authors
- Vu, K., Zheng, R., & Gao, J.
- Venue
- 2012 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2012-03
- Pages
- 2399-2407
- OpenAlex
- W2013390525
- Cited by
- 166
- References
- 1
- FWCI
- 10.83
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.