scholarly journals LPPS: A Distributed Cache Pushing BasedK-Anonymity Location Privacy Preserving Scheme

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Ming Chen ◽  
Wenzhong Li ◽  
Xu Chen ◽  
Zhuo Li ◽  
Sanglu Lu ◽  
...  
Keyword(s):  
Location Privacy ◽  
Markov Chain Model ◽  
Location Based Services ◽  
Mobile Users ◽  
Location Information ◽  
Communication Overhead ◽  
Chain Model ◽  
Primary Concern ◽  
Coverage Ratio ◽  
Distributed Cache

Recent years have witnessed the rapid growth of location-based services (LBSs) for mobile social network applications. To enable location-based services, mobile users are required to report their location information to the LBS servers and receive answers of location-based queries. Location privacy leak happens when such servers are compromised, which has been a primary concern for information security. To address this issue, we propose the Location Privacy Preservation Scheme (LPPS) based on distributed cache pushing. Unlike existing solutions, LPPS deploys distributed cache proxies to cover users mostly visited locations and proactively push cache content to mobile users, which can reduce the risk of leaking users’ location information. The proposed LPPS includes three major process. First, we propose an algorithm to find the optimal deployment of proxies to cover popular locations. Second, we present cache strategies for location-based queries based on the Markov chain model and propose update and replacement strategies for cache content maintenance. Third, we introduce a privacy protection scheme which is proved to achievek-anonymity guarantee for location-based services. Extensive experiments illustrate that the proposed LPPS achieves decent service coverage ratio and cache hit ratio with lower communication overhead compared to existing solutions.

scholarly journals Enabling Location Privacy Preservation in MANETs Based on Distance, Angle, and Spatial Cloaking

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 458
Author(s):  
Nanlan Jiang ◽  
Sai Yang ◽  
Pingping Xu
Keyword(s):  
Privacy Preservation ◽  
Location Privacy ◽  
Differential Privacy ◽  
Geographic Routing ◽  
Base Station ◽  
Wireless Channel ◽  
Location Based Services ◽  
Location Information ◽  
Communication Overhead ◽  
Spatial Cloaking

Preserving the location privacy of users in Mobile Ad hoc Networks (MANETs) is a significant challenge for location information. Most of the conventional Location Privacy Preservation (LPP) methods protect the privacy of the user while sacrificing the capability of retrieval on the server-side, that is, legitimate devices except the user itself cannot retrieve the location in most cases. On the other hand, applications such as geographic routing and location verification require the retrievability of locations on the access point, the base station, or a trusted server. Besides, with the development of networking technology such as caching technology, it is expected that more and more distributed location-based services will be deployed, which results in the risk of leaking location information in the wireless channel. Therefore, preserving location privacy in wireless channels without losing the retrievability of the real location is essential. In this paper, by focusing on the wireless channel, we propose a novel LPP enabled by distance (ranging result), angle, and the idea of spatial cloaking (DSC-LPP) to preserve location privacy in MANETs. DSC-LPP runs without the trusted third party nor the traditional cryptography tools in the line-of-sight environment, and it is suitable for MANETs such as the Internet of Things, even when the communication and computation capabilities of users are limited. Qualitative evaluation indicates that DSC-LPP can reduce the communication overhead when compared with k-anonymity, and the computation overhead of DSC-LPP is limited when compared with conventional cryptography. Meanwhile, the retrievability of DSC-LPP is higher than that of k-anonymity and differential privacy. Simulation results show that with the proper design of spatial divisions and parameters, other legitimate devices in a MANET can correctly retrieve the location of users with a high probability when adopting DSC-LPP.

scholarly journals Privacy vs. Reward in Indoor Location-Based Services

2016 ◽  
Vol 2016 (4) ◽  
pp. 102-122 ◽  
Author(s):  
Kassem Fawaz ◽  
Kyu-Han Kim ◽  
Kang G. Shin
Keyword(s):  
Location Privacy ◽  
Indoor Localization ◽  
Service Providers ◽  
Location Based Services ◽  
Location Information ◽  
Privacy Concerns ◽  
Indoor Location ◽  
Location Data ◽  
Personalized Services ◽  
Privacy Risks

AbstractWith the advance of indoor localization technology, indoor location-based services (ILBS) are gaining popularity. They, however, accompany privacy concerns. ILBS providers track the users’ mobility to learn more about their behavior, and then provide them with improved and personalized services. Our survey of 200 individuals highlighted their concerns about this tracking for potential leakage of their personal/private traits, but also showed their willingness to accept reduced tracking for improved service. In this paper, we propose PR-LBS (Privacy vs. Reward for Location-Based Service), a system that addresses these seemingly conflicting requirements by balancing the users’ privacy concerns and the benefits of sharing location information in indoor location tracking environments. PR-LBS relies on a novel location-privacy criterion to quantify the privacy risks pertaining to sharing indoor location information. It also employs a repeated play model to ensure that the received service is proportionate to the privacy risk. We implement and evaluate PR-LBS extensively with various real-world user mobility traces. Results show that PR-LBS has low overhead, protects the users’ privacy, and makes a good tradeoff between the quality of service for the users and the utility of shared location data for service providers.

scholarly journals An Efficient and Privacy-Preserving Multiuser Cloud-Based LBS Query Scheme

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Lu Ou ◽  
Hui Yin ◽  
Zheng Qin ◽  
Sheng Xiao ◽  
Guangyi Yang ◽  
...  
Keyword(s):  
Location Privacy ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Third Party ◽  
Location Information ◽  
User Privacy ◽  
User Revocation ◽  
And Performance ◽  
Cloud Infrastructures

Location-based services (LBSs) are increasingly popular in today’s society. People reveal their location information to LBS providers to obtain personalized services such as map directions, restaurant recommendations, and taxi reservations. Usually, LBS providers offer user privacy protection statement to assure users that their private location information would not be given away. However, many LBSs run on third-party cloud infrastructures. It is challenging to guarantee user location privacy against curious cloud operators while still permitting users to query their own location information data. In this paper, we propose an efficient privacy-preserving cloud-based LBS query scheme for the multiuser setting. We encrypt LBS data and LBS queries with a hybrid encryption mechanism, which can efficiently implement privacy-preserving search over encrypted LBS data and is very suitable for the multiuser setting with secure and effective user enrollment and user revocation. This paper contains security analysis and performance experiments to demonstrate the privacy-preserving properties and efficiency of our proposed scheme.

On the Use of Optimal Stopping Theory for Secret Sharing Scheme Update

2013 ◽  
pp. 276-295 ◽  
Author(s):  
Constantinos Delakouridis ◽  
Leonidas Kazatzopoulos
Keyword(s):  
Secret Sharing ◽  
Information Disclosure ◽  
Location Privacy ◽  
Location Based Services ◽  
Location Information ◽  
Cloud Infrastructure ◽  
Location Update ◽  
Location Services ◽  
Optimal Thresholds ◽  
Cryptographic Techniques

The location privacy issue has been addressed thoroughly so far. Cryptographic techniques, k-anonymity-based approaches, spatial obfuscation methods, mix-zones, pseudonyms, and dummy location signals have been proposed to enhance location privacy. In this chapter, the authors propose an approach, called STS (Share The Secret) that segments and distributes the location information to various, non-trusted, entities from where it will be reachable by authenticated location services. This secret sharing approach prevents location information disclosure even in situation where there is a direct observation of the target. The proposed approach facilitates end-users or location-based services to classify flexible privacy levels for different contexts of operation. The authors provide the optimal thresholds to alter the privacy policy levels when there is a need for relaxing or strengthening the required privacy. Additionally, they discuss the robustness of the proposed approach against various adversary models. Finally, the authors evaluate the approach in terms of computational and energy efficiency, using real mobile applications and location update scenarios over a cloud infrastructure, which is used to support storage and computational tasks.

scholarly journals Expectation-Maximization Tensor Factorization for Practical Location Privacy Attacks

2017 ◽  
Vol 2017 (4) ◽  
pp. 138-155 ◽  
Author(s):  
Takao Murakami
Keyword(s):  
Markov Chain ◽  
Expectation Maximization ◽  
Location Privacy ◽  
Viterbi Algorithm ◽  
Markov Chain Model ◽  
Chain Model ◽  
Tensor Factorization ◽  
Learning Methods ◽  
Realistic Situation ◽  
Target User

Abstract Location privacy attacks based on a Markov chain model have been widely studied to de-anonymize or de-obfuscate mobility traces. An adversary can perform various kinds of location privacy attacks using a personalized transition matrix, which is trained for each target user. However, the amount of training data available to the adversary can be very small, since many users do not disclose much location information in their daily lives. In addition, many locations can be missing from the training traces, since many users do not disclose their locations continuously but rather sporadically. In this paper, we show that the Markov chain model can be a threat even in this realistic situation. Specifically, we focus on a training phase (i.e. mobility profile building phase) and propose Expectation-Maximization Tensor Factorization (EMTF), which alternates between computing a distribution of missing locations (E-step) and computing personalized transition matrices via tensor factorization (M-step). Since the time complexity of EMTF is exponential in the number of missing locations, we propose two approximate learning methods, one of which uses the Viterbi algorithm while the other uses the Forward Filtering Backward Sampling (FFBS) algorithm. We apply our learning methods to a de-anonymization attack and a localization attack, and evaluate them using three real datasets. The results show that our learning methods significantly outperform a random guess, even when there is only one training trace composed of 10 locations per user, and each location is missing with probability 80% (i.e. even when users hardly disclose two temporally-continuous locations).

scholarly journals On Location Privacy Protection Algorithm Based on Edge Computing and Caching

2021 ◽  
Vol 2138 (1) ◽  
pp. 012010
Author(s):  
Xiaobei Xu ◽  
Huaju Song ◽  
Kai Zhang ◽  
Liwen Chen ◽  
Yuwen Qian
Keyword(s):  
Markov Chain ◽  
Privacy Protection ◽  
Location Privacy ◽  
Transmission Delay ◽  
Mobile Users ◽  
Communication Overhead ◽  
Prediction System ◽  
Hit Rate ◽  
Protection Method ◽  
Location Privacy Protection

Abstract To resolve the communication overhead problem of anonymous users, we propose a location privacy protection method based on the cache technology. In particular, we first place the cache center on edge server nodes to reduce interaction between servers and users. In this way, the risk of privacy leaks can be reduced. Furthermore, to improve the caching hit rate, a prediction system based on Markov chain is designed to protect the trajectory privacy of mobile users. Simulations show that the algorithm can protect the privacy of users and reduce the transmission delay.

scholarly journals Differential Privacy Location Protection Scheme Based on Hilbert Curve

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jie Wang ◽  
Feng Wang ◽  
Hongtao Li
Keyword(s):  
Privacy Protection ◽  
Location Privacy ◽  
Differential Privacy ◽  
Dimensional Space ◽  
Location Based Services ◽  
Data Availability ◽  
Location Information ◽  
Hilbert Curve ◽  
One Dimensional ◽  
Protection Scheme

Location-based services (LBS) applications provide convenience for people’s life and work, but the collection of location information may expose users’ privacy. Since these collected data contain much private information about users, a privacy protection scheme for location information is an impending need. In this paper, a protection scheme DPL-Hc is proposed. Firstly, the users’ location on the map is mapped into one-dimensional space by using Hilbert curve mapping technology. Then, the Laplace noise is added to the location information of one-dimensional space for perturbation, which considers more than 70% of the nonlocation information of users; meanwhile, the disturbance effect is achieved by adding noise. Finally, the disturbed location is submitted to the service provider as the users’ real location to protect the users’ location privacy. Theoretical analysis and simulation results show that the proposed scheme can protect the users’ location privacy without the trusted third party effectively. It has advantages in data availability, the degree of privacy protection, and the generation time of anonymous data sets, basically achieving the balance between privacy protection and service quality.

scholarly journals Nonexposure Accurate LocationK-Anonymity Algorithm in LBS

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jinying Jia ◽  
Fengli Zhang
Keyword(s):  
Privacy Protection ◽  
Location Privacy ◽  
Location Based Services ◽  
Experimental Results ◽  
Location Information ◽  
User Privacy ◽  
Spatial Region ◽  
Exact Location ◽  
Current Location ◽  
Location Privacy Protection

This paper tackles location privacy protection in current location-based services (LBS) where mobile users have to report their exact location information to an LBS provider in order to obtain their desired services. Location cloaking has been proposed and well studied to protect user privacy. It blurs the user’s accurate coordinate and replaces it with a well-shaped cloaked region. However, to obtain such an anonymous spatial region (ASR), nearly all existent cloaking algorithms require knowing the accurate locations of all users. Therefore, location cloaking without exposing the user’s accurate location to any party is urgently needed. In this paper, we present such two nonexposure accurate location cloaking algorithms. They are designed forK-anonymity, and cloaking is performed based on the identifications (IDs) of the grid areas which were reported by all the users, instead of directly on their accurate coordinates. Experimental results show that our algorithms are more secure than the existent cloaking algorithms, need not have all the users reporting their locations all the time, and can generate smaller ASR.

scholarly journals Location Privacy-Preserving Method Based on Historical Proximity Location

2020 ◽  
Vol 2020 ◽  
pp. 1-16 ◽  
Author(s):  
Xueying Guo ◽  
Wenming Wang ◽  
Haiping Huang ◽  
Qi Li ◽  
Reza Malekian
Keyword(s):  
Mobile Communications ◽  
Privacy Preservation ◽  
Location Privacy ◽  
Rapid Development ◽  
Main Idea ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Communication Overhead ◽  
Server Side ◽  
Current Location

With the rapid development of Internet services, mobile communications, and IoT applications, Location-Based Service (LBS) has become an indispensable part in our daily life in recent years. However, when users benefit from LBSs, the collection and analysis of users’ location data and trajectory information may jeopardize their privacy. To address this problem, a new privacy-preserving method based on historical proximity locations is proposed. The main idea of this approach is to substitute one existing historical adjacent location around the user for his/her current location and then submit the selected location to the LBS server. This method ensures that the user can obtain location-based services without submitting the real location information to the untrusted LBS server, which can improve the privacy-preserving level while reducing the calculation and communication overhead on the server side. Furthermore, our scheme can not only provide privacy preservation in snapshot queries but also protect trajectory privacy in continuous LBSs. Compared with other location privacy-preserving methods such as k-anonymity and dummy location, our scheme improves the quality of LBS and query efficiency while keeping a satisfactory privacy level.

scholarly journals A Location Privacy Attack Based on the Location Sharing Mechanism with Erroneous Distance in Geosocial Networks

Sensors ◽  
2020 ◽  
Vol 20 (3) ◽  
pp. 918 ◽  
Author(s):  
Tu-Liang Lin ◽  
Hong-Yi Chang ◽  
Sheng-Lin Li
Keyword(s):  
Location Privacy ◽  
Service Providers ◽  
Dominating Set ◽  
Research Area ◽  
Location Based Services ◽  
Location Information ◽  
Distance Information ◽  
Space Partition ◽  
Location Sharing ◽  
True Location

Geographical social networks (GSN) is an emerging research area. For example, Foursquare, Yelp, and WeChat are all well-known service providers in this field. These applications are also known as location-based services (LBS). Previous studies have suggested that these location-based services may expose user location information. In order to ensure the privacy of the user’s location data, the service provider may provide corresponding protection mechanisms for its applications, including spatial cloaking, fuzzy location information, etc., so that the user’s real location cannot be easily cracked. It has been shown that if the positioning data provided by the user is not accurate enough, it is still difficult for an attacker to obtain the user’s true location. Taking this factor into consideration, our attack method is divided into two stages for the entire attack process: (1) Search stage: cover the area where the targeted user is located with unit discs, and then calculate the minimum dominating set. Use the triangle positioning method to find the minimum precision disc. (2) Inference phase: Considering the existence of errors, an Error-Adjusted Space Partition Attack Algorithm (EASPAA) was proposed during the inference phase. Improved the need for accurate distance information to be able to derive the user’s true location. In this study, we focus on the Location Sharing Mechanism with Maximal Coverage Limit to implement the whole attack. Experimental results show that the proposed method still can accurately infer the user’s real location even when there is an error in the user’s location information.

Sign in / Sign up

Export Citation Format

Share Document