scholarly journals Enhancing Privacy Preserving Query Retrieval Using Locality Sensitive Hashing

2019 ◽  
pp. 70-73
Author(s):  
Archana M.S. ◽  
K. Deepa
Keyword(s):  
Location Privacy ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Locality Sensitive Hashing ◽  
Range Queries ◽  
Potential Threat ◽  
Encrypted Data ◽  
Points Of Interest ◽  
Spatial Range ◽  
Day By Day

The usage of smart phones is tremendously increasing day by day. Due to this, Location Based Services (LBS) attracted considerably and becomes more popular and vital in the area of mobile applications. On the other hand, the usage of LBS leads to potential threat to user’s location privacy. In this paper, the famous LBS provide information about points of interest (POI) in spatial range query within a given distance. For that, a more efficient and an enhanced privacy-preserving query solution for location based, Efficient Privacy-Location Query (EPLQ) is proposed along with Locality Sensitive Hashing (LSH) reduces the dimensionality of high dimensional data. Experiments are conducted extensively and the results show the efficiency of the proposed algorithm EPLQ in privacy preserving over outsourced encrypted data in spatial range queries. The proposed method performs in spatial range queries and similarity queries of privacy preserving.

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.

scholarly journals Privacy-Preserving Approximate k-Nearest-Neighbors Search that Hides Access, Query and Volume Patterns

2021 ◽  
Vol 2021 (4) ◽  
pp. 549-574
Author(s):  
Alexandra Boldyreva ◽  
Tianxin Tang
Keyword(s):  
Nearest Neighbors ◽  
Privacy Preserving ◽  
Locality Sensitive Hashing ◽  
Security Model ◽  
Symmetric Encryption ◽  
K Nearest Neighbors ◽  
Encrypted Data ◽  
Generic Construction ◽  
Knn Search ◽  
Security Guarantees

Abstract We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the client sends the encrypted data to an untrusted server and later can perform secure approximate kNN search and updates. We design a security model and propose a generic construction based on locality-sensitive hashing, symmetric encryption, and an oblivious map. The construction provides very strong security guarantees, not only hiding the information about the data, but also the access, query, and volume patterns. We implement, evaluate efficiency, and compare the performance of two concrete schemes based on an oblivious AVL tree and an oblivious BSkiplist.

scholarly journals Cache-Based Privacy Preserving Solution for Location and Content Protection in Location-Based Services

Sensors ◽  
2020 ◽  
Vol 20 (16) ◽  
pp. 4651
Author(s):  
Yuanbo Cui ◽  
Fei Gao ◽  
Wenmin Li ◽  
Yijie Shi ◽  
Hua Zhang ◽  
...  
Keyword(s):  
Location Privacy ◽  
Personal Information ◽  
Single Point ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Third Party ◽  
Content Protection ◽  
Query Privacy ◽  
Service Data

Location-Based Services (LBSs) are playing an increasingly important role in people’s daily activities nowadays. While enjoying the convenience provided by LBSs, users may lose privacy since they report their personal information to the untrusted LBS server. Although many approaches have been proposed to preserve users’ privacy, most of them just focus on the user’s location privacy, but do not consider the query privacy. Moreover, many existing approaches rely heavily on a trusted third-party (TTP) server, which may suffer from a single point of failure. To solve the problems above, in this paper we propose a Cache-Based Privacy-Preserving (CBPP) solution for users in LBSs. Different from the previous approaches, the proposed CBPP solution protects location privacy and query privacy simultaneously, while avoiding the problem of TTP server by having users collaborating with each other in a mobile peer-to-peer (P2P) environment. In the CBPP solution, each user keeps a buffer in his mobile device (e.g., smartphone) to record service data and acts as a micro TTP server. When a user needs LBSs, he sends a query to his neighbors first to seek for an answer. The user only contacts the LBS server when he cannot obtain the required service data from his neighbors. In this way, the user reduces the number of queries sent to the LBS server. We argue that the fewer queries are submitted to the LBS server, the less the user’s privacy is exposed. To users who have to send live queries to the LBS server, we employ the l-diversity, a powerful privacy protection definition that can guarantee the user’s privacy against attackers using background knowledge, to further protect their privacy. Evaluation results show that the proposed CBPP solution can effectively protect users’ location and query privacy with a lower communication cost and better quality of service.

Location Privacy-preserving Mechanisms in Location-based Services

2021 ◽  
Vol 54 (1) ◽  
pp. 1-36
Author(s):  
Hongbo Jiang ◽  
Jie Li ◽  
Ping Zhao ◽  
Fanzi Zeng ◽  
Zhu Xiao ◽  
...  
Keyword(s):  
Location Privacy ◽  
Privacy Preserving ◽  
Location Based Services

An Efficient Dummy-Based Location Privacy-Preserving Scheme for Internet of Things Services

Information ◽  
2019 ◽  
Vol 10 (9) ◽  
pp. 278
Author(s):  
Yongwen Du ◽  
Gang Cai ◽  
Xuejun Zhang ◽  
Ting Liu ◽  
Jinghua Jiang
Keyword(s):  
Internet Of Things ◽  
Location Privacy ◽  
Side Information ◽  
Rapid Development ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Location Based Services ◽  
User Privacy ◽  
Computational Costs ◽  
Smart Mobile

With the rapid development of GPS-equipped smart mobile devices and mobile computing, location-based services (LBS) are increasing in popularity in the Internet of Things (IoT). Although LBS provide enormous benefits to users, they inevitably introduce some significant privacy concerns. To protect user privacy, a variety of location privacy-preserving schemes have been recently proposed. Among these schemes, the dummy-based location privacy-preserving (DLP) scheme is a widely used approach to achieve location privacy for mobile users. However, the computation cost of the existing dummy-based location privacy-preserving schemes is too high to meet the practical requirements of resource-constrained IoT devices. Moreover, the DLP scheme is inadequate to resist against an adversary with side information. Thus, how to effectively select a dummy location is still a challenge. In this paper, we propose a novel lightweight dummy-based location privacy-preserving scheme, named the enhanced dummy-based location privacy-preserving(Enhanced-DLP) to address this challenge by considering both computational costs and side information. Specifically, the Enhanced-DLP adopts an improved greedy scheme to efficiently select dummy locations to form a k-anonymous set. A thorough security analysis demonstrated that our proposed Enhanced-DLP can protect user privacy against attacks. We performed a series of experiments to verify the effectiveness of our Enhanced-DLP. Compared with the existing scheme, the Enhanced-DLP can obtain lower computational costs for the selection of a dummy location and it can resist side information attacks. The experimental results illustrate that the Enhanced-DLP scheme can effectively be applied to protect the user’s location privacy in IoT applications and services.

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 Hail the Closest Driver on Roads: Privacy-Preserving Ride Matching in Online Ride Hailing Services

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Haining Yu ◽  
Hongli Zhang ◽  
Xiangzhan Yu
Keyword(s):  
Service Provider ◽  
Road Network ◽  
Location Privacy ◽  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Smartphone App ◽  
Network Embedding ◽  
Encrypted Data ◽  
Short Notice ◽  
Road Distance

Online ride hailing (ORH) services enable a rider to request a driver to take him wherever he wants through a smartphone app on short notice. To use ORH services, users have to submit their ride information to the ORH service provider to make ride matching, such as pick-up/drop-off location. However, the submission of ride information may lead to the leakages of users’ privacy. In this paper, we focus on the issue of protecting the location information of both riders and drivers during ride matching and propose a privacy-preserving online ride matching scheme, called pRMatch. It enables an ORH service provider to find the closest available driver for an incoming rider over a city-scale road network, while protecting the location privacy of both riders and drivers against the ORH service provider and other unauthorized participants. In pRMatch, we compute the shortest road distance over encrypted data by using road network embedding and partially homomorphic encryption and further efficiently compare encrypted distances by using ciphertext packing and shuffling. The theoretical analysis and experimental results demonstrate that pRMatch is accurate and efficient, yet preserving users’ location privacy.

scholarly journals GLPP: A Game-Based Location Privacy-Preserving Framework in Account Linked Mixed Location-Based Services

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Zhuo Ma ◽  
Jiuxin Cao ◽  
Xiusheng Chen ◽  
Shuai Xu ◽  
Bo Liu ◽  
...  
Keyword(s):  
Location Privacy ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Behavioral Analysis ◽  
Continuous Location ◽  
Real Dataset ◽  
Privacy Leakage ◽  
Cross Platform ◽  
Inference Attacks ◽  
Zero Sum

In Location-Based Services (LBSs) platforms, such as Foursquare and Swarm, the submitted position for a share or search leads to the exposure of users’ activities. Additionally, the cross-platform account linkage could aggravate this exposure, as the fusion of users’ information can enhance inference attacks on users’ next submitted location. Hence, in this paper, we propose GLPP, a personalized and continuous location privacy-preserving framework in account linked platforms with different LBSs (i.e., search-based LBSs and share-based LBSs). The key point of GLPP is to obfuscate every location submitted in search-based LBSs so as to defend dynamic inference attacks. Specifically, first, possible inference attacks are listed through user behavioral analysis. Second, for each specific attack, an obfuscation model is proposed to minimize location privacy leakage under a given location distortion, which ensures submitted locations’ utility for search-based LBSs. Third, for dynamic attacks, a framework based on zero-sum game is adopted to joint specific obfuscation above and minimize the location privacy leakage to a balanced point. Experiments on real dataset prove the effectiveness of our proposed attacks in Accuracy, Certainty, and Correctness and, meanwhile, also show the performance of our preserving solution in defense of attacks and guarantee of location utility.

Sign in / Sign up

Export Citation Format

Share Document