The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A peer-to-peer spatial cloaking algorithm for anonymous location-based service
Abstract
This paper tackles a major privacy threat in current location-based services where users have to report their exact locations to the database server in order to obtain their desired services. For example, a mobile user asking about her nearest restaurant has to report her exact location. With untrusted service providers, reporting private location information may lead to several privacy threats. In this paper, we present a peer-to-peer (P2P)spatial cloaking algorithm in which mobile and stationary users can entertain location-based services without revealing their exact location information. The main idea is that before requesting any location-based service, the mobile user will form a group from her peers via single-hop communication and/or multi-hop routing. Then,the spatial cloaked area is computed as the region that covers the entire group of peers. Two modes of operations are supported within the proposed P2P s patial cloaking algorithm, namely, the on-demand mode and the proactive mode. Experimental results show that the P2P spatial cloaking algorithm operated in the on-demand mode has lower communication cost and better quality of services than the proactive mode, but the on-demand incurs longer response time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
A survey of mobility models for ad hoc network research
Camp, T., Boleng, J., & Davies, V. (2002) · Wireless Communications and Mobile Computing · doi:10.1002/wcm.72 · Cited by 4,621
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Gruteser, M., & Grunwald, D. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1189037 · Cited by 2,275
ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s021848850200165x · Cited by 1,976
Location privacy in pervasive computing
Beresford, A. R., & Stajano, F. (2003) · IEEE Pervasive Computing · doi:10.1109/mprv.2003.1186725 · Cited by 1,568
Data Privacy through Optimal k-Anonymization
Bayardo, R. J., & Agrawal, R. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.42 · Cited by 1,131
Mondrian Multidimensional K-Anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.101 · Cited by 1,124
Incognito: efficient full-domain K-anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066164 · Cited by 1,070
The new Casper: query processing for location services without compromising privacy
Mokbel, M. F., Chow, C.-Y., & Aref, W. G. (2006) · doi:10.5555/1182635.1164193 · Cited by 999
Self-citationOn the complexity of optimal K-anonymity
Meyerson, A., & Williams, R. (2004) · Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1055558.1055591 · Cited by 821
An anonymous communication technique using dummies for location-based services
Kido, H., Yanagisawa, Y., & Satoh, T. (2005) · ICPS '05. Proceedings. International Conference on Pervasive Services, 2005. · doi:10.1109/perser.2005.1506394 · Cited by 683
A Formal Model of Obfuscation and Negotiation for Location Privacy
Duckham, M., & Kulik, L. (2005) · Lecture Notes in Computer Science · doi:10.1007/11428572_10 · Cited by 628
An architecture for privacy-sensitive ubiquitous computing
Hong, J. I., & Landay, J. A. (2004) · Proceedings of the 2nd international conference on Mobile systems, applications, and services · doi:10.1145/990064.990087 · Cited by 598
User needs for location-aware mobile services
Kaasinen, E. (2003) · Personal and Ubiquitous Computing · doi:10.1007/s00779-002-0214-7 · Cited by 521
Location-Based Services for Mobile Telephony: a study of users' privacy concerns
Barkhuus, L., & Dey, A. K. (2003) · IT University Of Copenhagen (IT University of Copenhagen) · Cited by 457
An overview of the challenges and progress in meeting the E-911 requirement for location service
Reed, J. H., Krizman, K. J., Woerner, B. D., & Rappaport, T. S. (1998) · IEEE Communications Magazine · doi:10.1109/35.667410 · Cited by 344
Protecting privacy in continuous location-tracking applications
Gruteser, M., & Liu, X. (2004) · IEEE Security & Privacy · doi:10.1109/msecp.2004.1281242 · Cited by 263
Self-citationA Customizable k-Anonymity Model for Protecting Location Privacy
Gedik, B., & Liu, L. (2004) · Cited by 192
Stream control transmission protocol (SCTP): a reference guide
Stewart, R., & Xie, Q. (2001) · Cited by 133
Protecting Access to People Location Information
Hengartner, U., & Steenkiste, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-39881-3_6 · Cited by 95
Towards Privacy-Aware Location-Based Database Servers
Mokbel, M. F. (2006) · IEEE International Conference on Data Engineering Workshops (ICDEW) · doi:10.1109/icdew.2006.152 · Cited by 83
Self-citationImplementing access control to people location information
Hengartner, U., & Steenkiste, P. (2004) · ACM Symposium on Access Control Models and Technologies (SACMAT) · doi:10.1145/990036.990039 · Cited by 67
Cited by
The new Casper: query processing for location services without compromising privacy
Mokbel, M. F., Chow, C.-Y., & Aref, W. G. (2006) · doi:10.5555/1182635.1164193 · Cited by 999
Self-citationPrivate queries in location based services: anonymizers are not necessary
Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., & Tan, K.-L. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376631 · Cited by 758
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
Kalnis, P., Ghinita, G., Mouratidis, K., & Papadias, D. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190662 · Cited by 620
PRIVE: anonymous location-based queries in distributed mobile systems
Ghinita, G., Kalnis, P., & Skiadopoulos, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242623 · Cited by 402
Yiu, M. L., Jensen, C. S., Huang, X., & Lu, H. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497445 · Cited by 330
Metadata
- Authors
- Chow, C.-Y., Mokbel, M. F., & Liu, X.
- Venue
- Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
- Publisher
- ACM
- Published
- 2006-11-10
- Pages
- 171-178
- OpenAlex
- W2074149673
- Cited by
- 506
- References
- 23
- FWCI
- 17.77
- 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.