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 Noise-added selection method for location-based service using differential privacy in Internet of Things

2019 ◽  
Vol 11 (1) ◽  
pp. 168781401882239 ◽  
Author(s):  
Zhimin Li ◽  
Haoze Lv ◽  
Zhaobin Liu
Keyword(s):  
Big Data ◽  
Internet Of Things ◽  
Privacy Protection ◽  
Location Privacy ◽  
Differential Privacy ◽  
Poor Performance ◽  
Data Availability ◽  
Location Information ◽  
Location Based Service ◽  
Protection Method

With the development of Internet of Things, many applications need to use people’s location information, resulting in a large amount of data need to be processed, called big data. In recent years, people propose many methods to protect privacy in the location-based service aspect. However, existing technologies have poor performance in big data area. For instance, sensor equipments such as smart phones with location record function may submit location information anytime and anywhere which may lead to privacy disclosure. Attackers can leverage huge data to achieve useful information. In this article, we propose noise-added selection algorithm, a location privacy protection method that satisfies differential privacy to prevent the data from privacy disclosure by attacker with arbitrary background knowledge. In view of Internet of Things, we maximize the availability of data and algorithm when protecting the information. In detail, we filter real-time location distribution information, use our selection mechanism for comparison and analysis to determine privacy-protected regions, and then perform differential privacy on them. As shown in the theoretical analysis and the experimental results, the proposed method can achieve significant improvements in security, privacy, and complete a perfect balance between privacy protection level and data availability.

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 A Context-Aware Location Differential Perturbation Scheme for Privacy-Aware Users in Mobile Environment

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Xuejun Zhang ◽  
Haiyan Huang ◽  
Shan Huang ◽  
Qian Chen ◽  
Tao Ju ◽  
...  
Keyword(s):  
Location Privacy ◽  
Differential Privacy ◽  
Location Based Services ◽  
Third Party ◽  
Background Information ◽  
Perturbation Scheme ◽  
Context Aware ◽  
Hilbert Curve ◽  
Mobile Environment ◽  
Retrieval Accuracy

The proliferation of location-based services, representative services for the mobile networks, has posed a serious threat to users’ privacy. In the literature, several privacy mechanisms have been proposed to preserve location privacy. Location obfuscation enforced using cloaking region is a widely used technique to achieve location privacy. However, it requires a trusted third-party (TTP) and cannot sufficiently resist various inference attacks based on background information and thus is vulnerable to location privacy breach. In this paper, we propose a context-aware location privacy-preserving solution with differential perturbations, which can enhance the user’s location privacy without requiring a TTP. Our scheme utilizes the modified Hilbert curve to project every 2-d location of the user in the considered map to 1-d space and randomly generates the reasonable perturbation by adding Laplace noise via differential privacy. In order to solve the resource limitation of mobile devices, we use a quad-tree based scheme to transform and store the user context information as bit stream which achieves the high compression ratio and supports efficient retrieval. Security analysis shows that our proposed scheme can effectively preserve the location privacy. Experimental evaluation shows that our scheme retrieval accuracy is increased by an average of 15.4% compared with the scheme using standard Hilbert curve. Our scheme can provide strong privacy guarantees with a bounded accuracy loss while improving retrieval accuracy.

scholarly journals Location Privacy Protection Scheme for LBS in IoT

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Hongtao Li ◽  
Xingsi Xue ◽  
Zhiying Li ◽  
Long Li ◽  
Jinbo Xiong
Keyword(s):  
Voronoi Diagram ◽  
Privacy Protection ◽  
Location Privacy ◽  
Location Information ◽  
Protection Scheme ◽  
Server Side ◽  
Location Data ◽  
Location Privacy Protection ◽  
Client Side ◽  
Grid Division

The widespread use of Internet of Things (IoT) technology has promoted location-based service (LBS) applications. Users can enjoy various conveniences brought by LBS by providing location information to LBS. However, it also brings potential privacy threats to location information. Location data that contains private information is often transmitted among IoT networks in LBS, and such privacy information should be protected. In order to solve the problem of location privacy leakage in LBS, a location privacy protection scheme based on k -anonymity is proposed in this paper, in which the Geohash coding model and Voronoi graph are used as grid division principles. We adopt the client-server-to-user (CS2U) model to protect the user’s location data on the client side and the server side, respectively. On the client side, the Geohash algorithm is proposed, which converts the user’s location coordinates into a Geohash code of the corresponding length. On the server side, the Geohash code generated by the user is inserted into the prefix tree, the prefix tree is used to find the nearest neighbors according to the characteristics of the coded similar prefixes, and the Voronoi diagram is used to divide the area units to complete the pruning. Then, using the Geohash coding model and the Voronoi diagram grid division principle, the G-V anonymity algorithm is proposed to find k neighbors in an anonymous area so that the user’s location data meets the k -anonymity requirement in the area unit, thereby achieving anonymity protection of location privacy. Theoretical analysis and experimental results show that our method is effective in terms of privacy and data quality while reducing the time of data anonymity.

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 recommendation privacy protection method based on location sensitivity division

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Chunyong Yin ◽  
Xiaokang Ju ◽  
Zhichao Yin ◽  
Jin Wang
Keyword(s):  
Service Quality ◽  
Privacy Protection ◽  
Location Privacy ◽  
Differential Privacy ◽  
Experimental Results ◽  
Location Information ◽  
Location Recommendation ◽  
Protection Method ◽  
Privacy Budget ◽  
The Impact

AbstractLocation-based recommendation services can provide users with convenient services, but this requires monitoring and collecting a large amount of location information. In order to prevent location information from being leaked after monitoring and collection, location privacy must be effectively protected. Therefore, this paper proposes a privacy protection method based on location sensitivity for location recommendation. This method uses location trajectories and check-in frequencies to set a threshold so as to classify location sensitivity levels. The corresponding privacy budget is then assigned based on the sensitivity to add Laplace noise that satisfies the differential privacy. Experimental results show that this method can effectively protect the user’s location privacy and reduce the impact of differential privacy noise on service quality.

scholarly journals Differential Privacy Location Protection Method Based on the Markov Model

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Hongtao Li ◽  
Yue Wang ◽  
Feng Guo ◽  
Jie Wang ◽  
Bo Wang ◽  
...  
Keyword(s):  
Markov Model ◽  
Location Privacy ◽  
Differential Privacy ◽  
Mobile Internet ◽  
Location Based Services ◽  
Data Availability ◽  
Internet Technology ◽  
Widespread Application ◽  
Location Data ◽  
Protection Method

Location-based services (LBS) have become an important research area with the rapid development of mobile Internet technology, GPS positioning technology, and the widespread application of smart phones and social networks. LBS can provide convenience and flexibility for the users’ daily life, but at the same time, it also brings security risks to the users’ privacy. Untrusted or malicious LBS servers can collect users’ location data through various ways and disclose it to the third party, thus causing users’ privacy leakage. In this paper, a differential privacy location protection method based on the Markov model for user’s location privacy is proposed. Firstly, the transition probability matrix between states of the n -order Markov model is used to predict the occurrence state and development trend of events; thereby, the user’s location is predicted, and then a location prediction algorithm based on the Markov model (LPAM) is proposed. Secondly, a location protection algorithm based on differential privacy (LPADP) is proposed, in which location privacy tree (LPT) is constructed according to the location data and the difficulty of retrieval, the two nodes with the largest predicted value of LPT are allocated with a reasonable privacy budget, and Laplace noise is added to protect location privacy. Theoretical analysis and experimental results show that the proposed method not only meets the requirements of differential privacy and protects location privacy effectively but also has high data availability and low time complexity.

Sign in / Sign up

Export Citation Format

Share Document