Academia.eduAcademia.edu

Outline

Title
Abstract
Chapter 1 Introduction 1.1 Location-Based Service
Summary
Distributed K-Anonymity Protocol
Security Analysis
Threat Analysis
Discussion
Brief Overview of Set-Union Protocols
Conclusions and Future Work
Introduction
Related Work
The Louis Protocol
The Lester Protocol
Analysis
The Pierre Protocol
Protocol Description
The Wilfrid Protocol
Comparison of the Protocols
Conclusion
Chapter 4 Conclusion and Future Work
References
All Topics
Computer Science
Cryptography

Distributed Approaches for Location Privacy

Profile image of Ge ZhongGe Zhong

2008

Abstract

With the advance of location technologies, people can now determine their location in various ways, for instance, with GPS or based on nearby cellphone towers. These technologies have led to the introduction of location-based services, which allow people to get information relevant to their current location. Location privacy is of utmost concern for such location-based services, since knowing a person’s location can reveal information about her activities or her interests. In this thesis, we first focus on location-based services that need to know only a person’s location, but not her identity. We propose a solution using location cloaking based on k-anonymity, which requires neither a single trusted location broker, which is a central server that knows everybody’s location, nor trust in all users of the system and that integrates nicely with existing infrastructures. Namely, we suggest having multiple brokers, each deployed by a different organization (e.g., an operator of a cellph...

Related papers

Protecting Privacy in Location-Based Services Using K-Anonymity without Cloaked Region
Shanthi Saravanan

2010 Eleventh International Conference on Mobile Data Management, 2010

The emerging location-detection devices together with ubiquitous connectivity have enabled a large variety of locationbased services (LBS). Unfortunately, LBS may threaten the users' privacy. K-anonymity cloaking the user location to Kanonymizing spatial region (K-ASR) has been extensively studied to protect privacy in LBS. Traditional K-anonymity method needs complex query processing algorithms at the server side. SpaceTwist [8] rectifies the above shortcoming of traditional Kanonymity since it only requires incremental nearest neighbor (INN) queries processing techniques at the server side. However, SpaceTwist may fail since it cannot guarantee K-anonymity. In this paper, our proposed framework, called KAWCR (Kanonymity Without Cloaked Region), rectifies the shortcomings and retains the advantages of the above two techniques. KAWCR only needs the server to process INN queries and can guarantee that the users issuing the query is indistinguishable from at least K-1 other users. We formulate the communication costs of KAWCR, traditional K-anonymity and SpaceTwist under the assumptions that POIs and users are uniformly distributed. We also did extensive experiments to compare KAWCR with traditional K-anonymity and SpaceTwist in terms of communication costs. The experimental results show that the communication cost of KAWCR for kNN queries is lower than that of both traditional K-anonymity and SpaceTwist.

View PDFchevron_right
LPM: A Distributed Architecture and Algorithms for Location Privacy in LBS
Muhamed Ilyas

2012

Recent advances in mobile communication and development of sophisticated equipments lead to the wide spread use of Location Based Services (LBS). A major concern for large-scale deployment of LBSs is the potential abuse of their client location data, which may imply sensitive personal information. Protecting location information of the mobile user is challenging because a location itself may reveal user identity. Several schemes have been proposed for location cloaking. In our paper, we propose a generic Enhanced Location Privacy Model (LPM), which describes the concept, the architecture, algorithms and the functionalities for location privacy in LBS. As per the architecture, the system ensures location privacy, without trusting anybody including the peers or LBS servers. The system is fully distributed and evaluation shows its efficiency and high level of privacy with QoS.

View PDFchevron_right
LPM: A Distributed Architecture and Alogorithms for Location Privacy in LBS
Muhamed Ilyas

International Journal of Network Security & Its Applications, 2012

Recent advances in mobile communication and development of sophisticated equipments lead to the wide spread use of Location Based Services (LBS). A major concern for large-scale deployment of LBSs is the potential abuse of their client location data, which may imply sensitive personal information. Protecting location information of the mobile user is challenging because a location itself may reveal user identity. Several schemes have been proposed for location cloaking. In our paper, we propose a generic Enhanced Location Privacy Model (LPM), which describes the concept, the architecture, algorithms and the functionalities for location privacy in LBS. As per the architecture, the system ensures location privacy, without trusting anybody including the peers or LBS servers. The system is fully distributed and evaluation shows its efficiency and high level of privacy with QoS.

View PDFchevron_right
A distributed privacy-preserving scheme for location-based queries
Panayiotis Kotzanikolaou

2010

In this paper we deal with security and historical privacy in Location Based Service (LBS) applications where users submit accurate location samples to an LBS provider. Specifically we propose a distributed scheme that establishes access control while protecting the privacy of a user in both sporadic and continuous LBS queries. Our solution employs a hybrid network architecture where LBS users: (a) are able to communicate with an LBS provider through a network (e.g., cellular) operator, and (b) they are also able to create wireless ad-hoc networks with other peers in order to obtain privacy against an adversary that performs traffic analysis. Our threat model considers the network operator, the LBS provider and other peers, as potential privacy adversaries. For historical privacy we adopt the generic approach of using multiple pseudonyms that are changed frequently. In order to establish untraceability against traffic analysis attacks, a message is not sent directly to the cellular operator, but it is distributed among mobile neighbors who act like mixes and re-encrypt a message before sending it to the LBS provider via the cellular operator. As an extension, we also discuss how to aggregate independent data from different mobile peers before sending them to the LBS provider. This approach may be suitable in applications where aggregate location data are useful (e.g., traffic monitoring and control)

View PDFchevron_right
Location Privacy in Mobile Systems: A Personalized Anonymization Model
Ling Liu

This paper describes a personalized k-anonymity model for protecting location privacy against various privacy threats through location information sharing. Our model has two unique features. First, we provide a unified privacy personalization framework to support location k-anonymity for a wide range of users with context-sensitive personalized privacy requirements. This framework enables each mobile node to specify the minimum level of anonymity it desires as well as the maximum temporal and spatial resolutions it is willing to tolerate when requesting for k-anonymity preserving location-based services (LBSs). Second, we devise an efficient message perturbation engine which runs by the location protection broker on a trusted server and performs location anonymization on mobile users' LBS request messages, such as identity removal and spatio-temporal cloaking of location information. We develop a suite of scalable and yet efficient spatio-temporal cloaking algorithms, called CliqueCloak algorithms, to provide high quality personalized location k-anonymity, aiming at avoiding or reducing known location privacy threats before forwarding requests to LBS provider(s). The effectiveness of our CliqueCloak algorithms is studied under various conditions using realistic location data synthetically generated using real road maps and traffic volume data.

View PDFchevron_right
A framework for Enhancing Privacy in Location Based Services
jane mugi

Jomo Kenyatta University of Agriculture and Technology, 2016

This paper presents a framework for enhancing privacy in Location Based Services using K-anonymity model. Users of location based services have to reveal their location information in order to use these services; however this has threatened the user privacy. K-anonymity approach has been studied extensively in various forms. However, it is only effective when the user location is fixed. When a user moves and continuously sends their location information, the location service provider can approximate user trajectory which poses a threat to the trajectory privacy of the user. This framework will ensure that user privacy is enhanced for both snapshot and continuous queries. The efficiency and effectiveness of the proposed framework was evaluated, the results indicate that the proposed framework has high success rate and good run time performance.

View PDFchevron_right
A Framework For Enhancing Privacy In Location Based Services Using K-Anonymity Model
jane mugi

2015

This paper presents a framework for enhancing privacy in Location Based Services using K-anonymity model. Users of location based services have to reveal their location information in order to use these services; however this has threatened the user privacy. K-anonymity approach has been studied extensively in various forms. However, it is only effective when the user location is fixed. When a user moves and continuously sends their location information, the location service provider can approximate user trajectory which poses a threat to the trajectory privacy of the user. This framework will ensure that user privacy is enhanced for both snapshot and continuous queries. The efficiency and effectiveness of the proposed framework was evaluated, the results indicate that the proposed framework has high success rate and good run time performance.

View PDFchevron_right
Privacy-Aware Cloaking Technique in Location-Based Services
Al Amin Hossain

2012 IEEE First International Conference on Mobile Services, 2012

The explosive growth of location-detection devices, such as GPS (Global Positioning System), continuously increasing users' privacy threat in location-based services (LBSs). However, in order to enjoy such services, the user must precisely disclose his/her exact location to the LBS. So, it is a key challenge to efficiently preserve user's privacy while accessing LBS. For this, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, it suffers from privacy attack. Therefore, we wish to provide the solution which can preserve user privacy by utilizing k-anonymity mechanism. In this paper, we propose a weighted adjacency graph based k-anonymous cloaking technique that can ensure users privacy protection and also reduce bandwidth usages. Our cloaking approach efficiently supports k-nearest neighbor queries without revealing private information of the query initiator. We demonstrate via experimental results that our algorithm yields much better performance than the existing one.

View PDFchevron_right
Achieving Anonymous Location-Based Services
Alisdair McDiarmid

… , 2004. VTC2004-Fall. 2004 IEEE 60th, 2005

View PDFchevron_right
Louis, Lester and Pierre: Three Protocols for Location Privacy
Ge Zhong

Privacy Enhancing Technologies

Location privacy is of utmost concern for location-based services. It is the property that a person's location is revealed to other entities, such as a service provider or the person's friends, only if this release is strictly necessary and authorized by the person. We study how to achieve location privacy for a service that alerts people of nearby friends. Here, location privacy guarantees that users of the service can learn a friend's location if and only if the friend is actually nearby. We introduce three protocols-Louis, Lester and Pierre-that provide location privacy for such a service. The key advantage of our protocols is that they are distributed and do not require a separate service provider that is aware of people's locations. The evaluation of our sample implementation demonstrates that the protocols are sufficiently fast to be practical.

View PDFchevron_right

References (61)

  1. J. Al-Muhtadi, R. Campbell, A. Kapadia, M. D. Mickunas, and S. Yi. Routing Through the Mist: Privacy Preserving Communication in Ubiquitous Com- puting Environments. In Proceedings of 22nd International Conference on Distributed Computing Systems (ICDCS'02), pages 65-74, July 2002.
  2. M. J. Atallah and W. Du. Secure Multi-party Computational Geometry. In Proceedings of 7th International Workshop on Algorithms and Data Structures, pages 165-179, August 2001. 39
  3. E. Bangerter, J. Camenisch, and A. Lysyanskaya. A Cryptographic Framework for the Controlled Release of Certified Data. In Proceedings of 12th Interna- tional Workshop on Security Protocols, pages 26-28, April 2004.
  4. L. Barkuus and A. Dey. Location-based services for mobile telephony: A study of users' privacy concerns. In Proceeding of 9th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT), 2003. 9
  5. A. R. Beresford. Location privacy in ubiquitous computing. Technical Report 612, Computer Laboratory, University of Cambridge, January 2005. 3, 5, 10
  6. A. R. Beresford and F. Stajano. Location Privacy in Pervasive Computing. IEEE Pervasive Computing, 2(1):46-55, 2003. 4
  7. C. Bettini, S. Mascetti, X. S. Wang, and S. Jajodia. Anonymity in Location- based Services: Towards a General Framework. In Proceedings of 8th Inter- national Conference on Mobile Data Management (MDM 2007), pages 67-79, May 2007. 5, 10
  8. I. F. Blake and V. Kolesnikov. Strong Conditional Oblivious Transfer and Computing on Intervals. In Proceedings of ASIACRYPT 2004, pages 515-529, December 2004. 9, 13
  9. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-DNF Formulas on Ci- phertexts. In Theory of Cryptography (TCC) '05, Lecture Notes in Computer Science 3378, pages 325-341. Springer-Verlag, 2005. 47
  10. F. Brandt. Efficient Cryptographic Protocol Design based on Distributed El Gamal Encryption. In Proceedings of 8th International Conference on Infor- mation Security and Cryptology (ICISC), pages 32-47, December 2005. 14, 39
  11. C. Cachin. Efficient Private Bidding and Auctions with an Oblivious Third Party. In Proceedings of 6th ACM Conference on Computer and Communica- tions Security, pages 120-127, November 1999. 39
  12. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Compact E-Cash. In Proceedings of EUROCRYPT 2005, pages 302-321, May 2005. 21
  13. D. Chaum. Blind Signatures for Untraceable Payments. In Proceedings of CRYPTO '82, pages 199-203, August 1982. 20
  14. D. Chaum. Blind Signature System. In Proceedings of CRYPTO '83, pages 153-156, August 1983. 21
  15. D. Chaum. Security without Identification: Transaction Systems to Make Big Brother Obsolete. Communications of the ACM, 28(10):1030-1044, 1985. 21
  16. R. Cheng, Y. Zhang, E. Bertino, and S. Prabhakar. Preserving User Location Privacy in Mobile Data Management Infrastructures. In Proceedings of 6th Workshop on Privacy Enhancing Technologies (PET 2006), Lecture Notes in Computer Science 4258, pages 393-412. Springer-Verlag, June 2006. 5, 38, 41
  17. C.-Y. Chow, M. F. Mokbel, and X. Liu. A Peer-to-Peer Spatial Cloaking Algorithm for Anonymous Location-based Services. In Proceedings of 14th ACM International Symposium on Advances in Geographic Information Sys- tems (ACM-GIS'06), pages 171-178, November 2006. 5, 10
  18. R. Cramer, R. Gennaro, and B. Schoenmakers. A Secure and Optimally Effi- cient Multi-Authority Election Scheme. In Advances in Cryptology-Eurocrypt '97, Lecture Notes in Computer Science 1233, pages 103-118. Springer-Verlag, 1997. 40
  19. I. Damgård and M. Jurik. A Generalisation, a Simplification and some Ap- plications of Paillier's Probabilistic Public-Key System. In Proceedings of 4th International Workshop on Practice and Theory in Public Key Cryptography, pages 119-136, February 2001. 25
  20. T. Dierks and E. Rescorla. The Transport Layer Security (TLS) Protocol Version 1.1. RFC 4346, http://www.ietf.org/rfc/rfc4346.txt, April 2006. 38, 45
  21. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The Second-Generation Onion Router. In Proceedings of 13th USENIX Security Symposium, pages 303-319, August 2004. 11
  22. W. Du and Z. Zhan. A Practical Approach to Solve Secure Multi-party Compu- tation Protocols. In Proceedings of 2002 Workshop on New Security Paradigms Workshop, pages 127-135, September 2002. 39
  23. M. Duckham and L. Kulik. Location Privacy and Location-Aware Computing. In J. et al. Drummond, editor, Dynamic and Mobile GIS: Investigating Changes in Space and Time, pages 35-52. CRC Press:Boca Raton, FL USA, 2006. 2
  24. M. Fischlin. A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. In Proceedings of RSA Security 2001 Cryptographer's Track, pages 457-471, April 2001. 14, 29
  25. Poupard G. Fouque, P. and Stern J. Sharing Decryption in the Context of Voting or Lotteries. In FC '00: Proceedings of the 4th International Conference on Financial Cryptography, pages 90-104, London, UK, 2001. Springer-Verlag. 12
  26. M.J. Freedman, K. Nissim, and B. Pinkas. Efficient Private matching and Set Intersection. In Advances in Cryptology-EUROCRYPT 2004, May 2004. 52
  27. S. Garriss, Kaminsky M., Freedman M., Karp B., Maziéres D., and H. Yu. RE: Reliable Email. In Proceedings of the 3rd Symposium on Networked Systems Design & Implementation (NSDI'06), May 2006. 51
  28. B. Gedik and L. Liu. Location Privacy in Mobile Systems: A Personalized Anonymization Model. In Proceedings of 25th International Conference on Distributed Computing Systems (ICDCS 2005), pages 620-629, June 2005. 5, 10, 38, 41
  29. G. Ghinita, P. Kalnis, and S. Skiadopoulos. MobiHide: A Mobile Peer-to-Peer System for Anonymous Location-Based Queries. In Proceedings of Proceedings of 10th International Symposium on Spatial and Temporal Databases (SSTD 2007), pages 221-238, July 2007. 5, 10, 11
  30. G. Ghinita, P. Kalnis, and S. Skiadopoulos. PRIV É: Anonymous Location- Based Queries in Distributed Mobile Systems. In Proceedings of 16th Interna- tional World Wide Web Conference (WWW2007), pages 371-380, May 2007. 5, 10
  31. J. Groth. A Verifiable Secret Shuffle of Homomorphic Encryptions. In Pro- ceedings of 6th International Workshop on Practice and Theory in Public Key Cryptography, pages 145-160, January 2003. 25
  32. M. Gruteser and D. Grunwald. Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking. In Proceedings of 1st International Conference on Mobile Systems, Applications, and Services (MobiSys 2003), pages 31-42, May 2003. 5, 8, 10, 38, 41
  33. T. Jiang, H. Wang, and Y.-C. Hu. Preserving Location Privacy in Wireless LANs. In Proceedings of the 5th International Conference on Mobile Systems, Applications, and Service (MobiSys), June 2007. 4
  34. T. Jiang, H. J. Wang, and Y.-C. Hu. Preserving Location Privacy in Wireless LANs. In Proceedings of 5th International Conference on Mobile Systems, Applications, and Services (MobiSys 2007), pages 246-257, June 2007.
  35. P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias. Preserving Anonymity in Location Based Services. Technical Report TRB6/06, School of Computing, The National University of Singapore, 2006. 5, 10
  36. A. Kapadia, N. Triandopoulos, C. Cornelius, D. Peebles, and D. Kotz. Anony- Sense: Opportunistic and Privacy-Preserving Context Collection. In Pro- ceedings of 6th International Conference on Pervasive Computing (Pervasive 2008), pages 280-297, May 2008. 11
  37. F. Kerschbaum. Distance-Preserving Pseudonymization for Timestamps and Spatial Data. In Proceedings of the 2007 ACM workshop on Privacy in elec- tronic society (WPES), October 2007. 39
  38. H. Kido, Y. Yanagisawa, and T. Satoh. An Anonymous Communication Tech- nique using Dummies for Location-based Services. In Proceedings of the 2nd IEEE International Conference on Pervasive Services (ICPS), 2005. 4
  39. L. Kissner and D. Song. Privacy-Preserving Set Operations. In Proceedings of CRYPTO 2005, pages 241-257, August 2005. 30, 51
  40. P. Kocher. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In Advances in Cryptology-CRYPTO '96, Lecture Notes in Computer Science 1109, pages 104-113. Springer-Verlag, August 1996. 47
  41. M. Kohlweiss, S. Faust, L. Fritsch, B. Gedrojc, and P. Preneel. Efficient Oblivious Augmented Maps: Location-Based Services with a Payment Broker. In Proceedings of 7th Privacy Enhancing Technologies Symposium (PET 2007), pages 77-94, June 2007. 57
  42. G. M. Køien and V. A. Oleshchuk. Location Privacy for Cellular Systems; Analysis and Solutions. In Proceedings of 5th Workshop on Privacy Enhancing Technologies (PET 2005), Lecture Notes in Computer Science 3856, pages 40- 58.
  43. Springer-Verlag, May/June 2005. 38
  44. T. Kölsch, L. Fritsch, M. Kohlweiss, and D. Kesdogan. Privacy for Profitable Location Based Services. In Proceedings of 2nd International Conference on Security in Pervasive Computing (SPC 2005), pages 164-178, April 2005.
  45. M. Li, K. Sampigethaya, and Poovendran R. Huang, L. Swing & Swap: User- Centric Approaches Towards Maximizing Location Privacy. In Proceedings of 5th Workshop on Privacy in the Electronic Society (WPES), pages 19-28, October 2006. 4
  46. Loopt, Inc. loopt -Live In It. http://www.loopt.com/. Accessed February 2007. 37, 41
  47. S. Mascetti and C. Bettini. A Comparison of Spatial Generalization Algorithms for LBS Privacy Preservation. In Proceedings of International Workshop on Privacy-Aware Location-based Mobile Services (PALMS), May 2007. 5, 10
  48. MIT SENSEable City Lab. iFind. http://ifind.mit.edu/. Accessed Febru- ary 2007. 37
  49. M. F. Mokbel, C.-Y. Chow, and W. G. Aref. The New Casper: Query Pro- cessing for Location Services without Compromising Privacy. In Proceedings of 32nd International Conference on Very Large Data Bases (VLDB 2006), pages 763-774, September 2006. 5, 10, 38
  50. The OpenSSL Project. OpenSSL: The Open Source toolkit for SSL/TLS. http://www.openssl.org. Accessed February 2008. 22, 43
  51. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Proceedings of EUROCRYPT '99, pages 223-238, May 1999. 9, 11
  52. J.M. Pollard. Monte Carlo Methods for Index Computation (mod p). Mathe- matics of Computation, 32(143):918-924, July 1978. 40, 45
  53. M. O. Rabin. How to Exchange Secrets with Oblivious Transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University, 1981. 57
  54. P. Samarati and L. Sweeney. Protecting Privacy when Disclosing Information: k-Anonymity and Its Enforcement through Generalization and Suppression. Technical Report SRI-CSL-98-04, SRI International, 1998. 5, 10
  55. D. Shanks. Class number, a theory of factorization, and genera. Proceedings of Symposia in Pure Mathematics, 20:415-440, 1971. 45
  56. Victor Shoup. NTL: A Library for doing Number Theory. http://www.shoup. net/ntl. Accessed February 2008. 22, 43
  57. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking, 11(1):17-32, 2003. 11
  58. L. Sweeney. k-anonymity: a model for protecting privacy. International Jour- nal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557-570, 2002.
  59. A. C. Yao. Protocols for Secure Computations. In Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982. 14, 39
  60. T.-H. You, W.-C. Peng, and W.-C Lee. Protecting Moving Trajectories with Dummies. In Proceedings of the first International Workshop on Privacy-Aware Location-based Mobile Services, May 2007. 4
  61. G. Zhong, I. Goldberg, and U. Hengartner. Louis, Lester and Pierre: Three Protocols for Location Privacy. In Proceedings of Seventh Privacy Enhancing Technologies Symposium (PET 2007), Ottawa, Canada, June 2007. 38

Related papers

A collaborative k-anonymity approach for location privacy in location-based services
James Joshi

Proceedings of the 5th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing, 2009

Considering the growth of wireless communication and mobile positioning technologies, location-based services (LBSs) have been generating increasing research interest in recent years. One of the critical issues for the deployment of LBS applications is how to reconcile their quality of service with privacy concerns. Location privacy based on k-anonymity is a very common way to hide the real locations of the users from the LBS provider. Several k-anonymity approaches have been proposed in the literature, each with some drawbacks. They need either a trusted third party or the users (or providers) to trust each other in collaborative approaches. In this paper, we propose a collaborative approach that provides k-anonymity in a distributed manner and does not require a trusted third party nor the users (or providers) to trust each other. Furthermore, our approach integrates well with the existing communication infrastructure. A user's location is known to only his/her location provider (e.g., cell phone operator). By using cryptographic schemes, user with the help of location providers determines whether the k-anonymity property is satisfied in a query area or not. We start with a simple scenario where user and location providers are honest-but-curious and then we progressively extend our protocol to deal with scenarios where entities may collude with each other. Moreover, we analyze possible threats and discuss how our proposed approach defends against such threats.

View PDFchevron_right
A distributed k-anonymity protocol for location privacy
Ge Zhong

2009 IEEE International Conference on Pervasive Computing and Communications, 2009

To benefit from a location-based service, a person must reveal her location to the service. However, knowing the person's location might allow the service to re-identify the person. Location privacy based on k-anonymity addresses this threat by cloaking the person's location such that there are at least k − 1 other people within the cloaked area and by revealing only the cloaked area to a location-based service. Previous research has explored two ways of cloaking: First, have a central server that knows everybody's location determine the cloaked area. However, this server needs to be trusted by all users and is a single point of failure. Second, have users jointly determine the cloaked area. However, this approach requires that all users trust each other, which will likely not hold in practice. We propose a distributed approach that does not have these drawbacks. Our approach assumes that there are multiple servers, each deployed by a different organization. A user's location is known to only one of the servers (e.g., to her cellphone provider), and different users let different servers (cellphone providers) know of their location. With the help of cryptography, the servers and a user jointly determine whether the k-anonymity property holds for the user's area, without the servers learning any additional information, not even whether the property holds. A user learns whether the k-anonymity property is satisfied, but no other information. The evaluation of our sample implementation shows that our distributed k-anonymity protocol is sufficiently fast to be practical. Moreover, our protocol integrates well with existing infrastructures for locationbased services, as opposed to the previous research.

View PDFchevron_right
Providing K-Anonymity in location based services
Vassilios Verykios

ACM SIGKDD Explorations Newsletter, 2010

The offering of anonymity in relational databases has attracted a great deal of attention in the database community during the last decade . Among the different solution approaches that have been proposed to tackle this problem, K-anonymity has received increased attention and has been extensively studied in various forms. New forms of data that come into existence, like location data capturing user movement, pave the way for the offering of cutting edge services such as the prevailing Location Based Services (LBSs). Given that these services assume an in-depth knowledge of the mobile users' whereabouts it is certain that the assumed knowledge may breach the privacy of the users. Thus, concrete approaches are necessary to preserve the anonymity of the mobile users when requesting LBSs. In this work, we survey recent advancements for the offering of K-anonymity in LBSs. Most of the approaches that have been proposed heavily depend on a trusted server component -that acts as an intermediate between the end user and the service provider -to preserve the anonymity of the former entity. Existing approaches are partitioned in three categories: (a) historical K-anonymity, (b) location K-anonymity, and (c) trajectory K-anonymity. In each of these categories we present some of the most prevalent methodologies that have been proposed and highlight their operation.

View PDFchevron_right
An Alternative Approach to k-Anonymity for Location-Based Services
Jigyarth Joshi

2011

Users of location-based services (LBSs) may have serious privacy concerns when using these technologies since their location can be utilized by adversaries to infer privacy-sensitive information about them. In this work, we analyze the mainstream anonymity solutions proposed for LBSs based on k-anonymity, and point out that these do not follow the safe assumptions as per the original definition of k-anonymity. We propose an alternative LBS anonymity property, LBS (k,T)-anonymity, that ensures anonymity of a user's query against an attacker who knows about the issuance of the user query within a time window. We evaluate the vulnerability of the approaches in the literature to this type of attack that we believe is very basic and important, and assess the performance of our proposed algorithm for achieving LBS (k,T)-anonymity in terms of providing optimal solution.

View PDFchevron_right
Protecting Location Privacy in Mobile Computing Systems Architecture and Algorithms
Ling Liu
View PDFchevron_right

Related topics

  • Computer Science
  • Computer Security
  • Cryptography
  • Location Privacy
  • Location Based Service
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved