ACM Home Page
Please provide us with feedback. Feedback
Location anonymity in continuous location-based services
Full text PdfPdf (551 KB)
Source Geographic Information Systems archive
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems table of contents
Seattle, Washington
SESSION: Spatiotemporal databases and moving objects table of contents
Article No. 39  
Year of Publication: 2007
ISBN:978-1-59593-914-2
Authors
Toby Xu  Iowa State University, Ames, Iowa
Ying Cai  Iowa State University, Ames, Iowa
Sponsors
: Oak Ridge National Laboratory
: Google
: ESRI
Microsoft : Microsoft
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 44,   Downloads (12 Months): 281,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1341012.1341062
What is a DOI?

ABSTRACT

A major concern for large-scale deployment of location-based services (LBSs) is the potential abuse of their client location data, which may imply sensitive personal information. Location privacy protection is challenging because a location itself may reveal a subject's identity. To support location anonymity, existing research reduces location resolution by ensuring each location reported to a service provider is a cloaking area that contains at least K mobile nodes. This strategy is effective when each location update can be considered as an independent event. In this paper, we investigate location anonymity in the context of continuous LBSs, which require frequent location updates from service users. Knowing that a user is inside a cloaking area constrains its position in the next cloaking area. Thus, simply ensuring each cloaking area contains at least K users does not give a user K-anonymity protection. We propose to measure the anonymity degree of a cloaking area using entropy, which takes into account not only the number of the entities inside, but also their anonymity probability distribution. To find a cloaking area that can provide a given level of anonymity protection and is also as small as possible, we present a novel technique with a polynomial time complexity. The effectiveness of our techniques is studied under various conditions using location data synthetically generated using real road maps and traffic volume data. The results show that our techniques can indeed protect user anonymity at a desired level, and at the same time, minimize the size of each cloaking area, allowing users to receive high quality services.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P. E. Agre. Transport Informatics and the New Landscape of Privacy Issues. In Computer Professionals for Social Responsibility (CPSR) Newsletter, volume 13(3), 1995.
 
2
L. Barkhuus and A. Dey. Location-based Services for Mobile Telephony: A Study of Users' Privacy Concerns. In 9th International Conference on Human-Computer Interaction, 2003.
 
3
 
4
 
5
 
6
R. Cheng, Y. Zhang, E. Bertino, and S. Prabhakar. Preserving User Location Privacy in Mobile Data Management Infrastructure. In 6th Workshop on Privacy Enhancing Technologies, 2006.
7
 
8
 
9
J. Cuellar, J. Morris, and D. Mulligan. In Internet Engineering Task Force Geopriv Requirements, http://www.ietf.org/html.charters/geopriv-charter.html.
 
10
11
 
12
B. Gedik and L. Liu. A Customizable k-Anonymity Model for Protecting Location Privacy. In ICDCS'05, pages 620--629, 2005.
13
 
14
 
15
P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias. Preserving Anonymity in Location Based Services. In Technical Report TRB6/06, Department of Computer Science, National University of Singapore.
 
16
P. A. Karger and Y. Frankel. Security and Privacy Threats to ITS. In Proceedings of the Second World Congress on Intelligent Transport Systems, volume 5, pages 2452--2458, 1995.
 
17
H. Kido, Y. Yanagisawa, and T. Satoh. An Anonymous Communication Technique using Dummies for Location-based Services. In IEEE ICPS'05, pages 88--97, 2005.
 
18
19
 
20
21
 
22
23
 
24
G. Myles, A. Friday, and N. Davies. Preserving Privacy in Environments with Location-based Applications. In IEEE Pervasive Computing, volume 02, pages 56--64, 2003.
 
25
D. Reid. An Algorithm for Tracking Multiple Targets. IEEE Transactions on Automatic Control, 24(6):843--854, December 1979.
26
 
27
A. Serjantov and G. Danezis. Towards an Information Theoretic Metric for Anonymity. In Roger Dingledine and Paul Syverson, editors, Privacy Enhancing Technologies workshop (PET 2002), volume 2482 of LNCS, pages 41--53. Springer-Verlag, 2002.
 
28
C. Shannon. The Mathematical Theory of Communication. In Bell System Technical Journal, volume 30, pages 50--64, 1948.
 
29
 
30
 
31
 
32
33
 
34
J. Warrior, E. McHenry, and K. McGee. They Know Where You Are. In IEEE Spectrum, 2003.
 
35
B. Zheng, W.-C. Lee, and D. Lee. Search continuous nearest neighbors on the air. In the First International Conference on Mobile and Ubiquitous Systems: Networking and Services (Mobiquitous'04), pages 236--245, Boston, MA, U.S.A, August 22--26 2004.