Efficient and Privacy-Preserving Polygons Spatial Query Framework for Location-Based Services

Zhu, Hui; Liu, Fen; Li, Hui

doi:10.1109/jiot.2016.2553083

Cited by 51 publications

(43 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although schemes [20][21][22][23] are able to calculate the average sensory data in each data dimension, they bring heavy computation costs and communication overhead. In addition, the query vehicle usually wants to know the road conditions of the potential moving route, which could lead to that the query location being disclosed in the data query process, the schemes in [23][24][25][26][27] have been proposed to solve this problem.…”

Section: Related Workmentioning

confidence: 99%

“…The oblivious transfer [24,25], homomorphic encryption technology [26,27], and proxy re-encryption technique [23] have been exploited to hide the query location. However, it is worth noting that the computation and communication costs by the schemes [24,25] is directly proportional to the data dimension, the schemes [26,27] do not support the scenario with high vehicle density, and the scheme [23] needs heavy computation and communication costs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Privacy-Preserving Data Sharing for Fog-Assisted Vehicular Sensor Networks

Yang

2020

Sensors

View full text Add to dashboard Cite

Vehicular sensor networks (VSNs) have emerged as a paradigm for improving traffic safety in urban cities. However, there are still several issues with VSNs. Vehicles equipped with sensing devices usually upload large amounts of data reports to a remote cloud center for processing and analyzing, causing heavy computation and communication costs. Additionally, to choose an optimal route, it is required for vehicles to query the remote cloud center to obtain road conditions of the potential moving route, leading to an increased communication delay and leakage of location privacy. To solve these problems, this paper proposes an efficient privacy-preserving data sharing (EP 2 DS) scheme for fog-assisted vehicular sensor networks. Specifically, the proposed scheme utilizes fog computing to provide local data sharing with low latency; furthermore, it exploits a super-increasing sequence to format the sensing data of different road segments into one report, thus saving on the resources of communication and computation. In addition, using the modified oblivious transfer technology, the proposed scheme can query the road conditions of the potential moving route without disclosing the query location. Finally, an analysis of security suggests that the proposed scheme can satisfy all the requirements for security and privacy, with the evaluation results indicating that the proposed scheme leads to low costs in computation and communication.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient Privacy-Preserving Data Sharing for Fog-Assisted Vehicular Sensor Networks

Yang

2020

Sensors

View full text Add to dashboard Cite

show abstract

“…Hui Zhu, Fen Liu, Hui Li et.al [9] presented an efficient approach as a framework for the security threats in Internet of Things for the location based scenarios. As the mobile technology is increasing day by day and the advancement of wireless communication skill, location constructed facilities have made human life more suitable, and they have provided polygons longitudinal interrogation, which is able to provide more flexible approach and consumes substantial interest freshly.…”

Section: Mahmud Hossain Maziar Fotouhi and Ragibmentioning

confidence: 99%

“…Many upright sections are predictable to knowledge a double digit evolution in upcoming centuries. The most forthcoming vertical solicitation provinces are consumer electronics, automotive productions, healthcare and intelligent constructions and conveniences [7][8] [9]. Some few examples related to the Internet of Things.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Approach for the Security Threats on Data Centers in IOT Environment

Alshammari¹

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Internet of Things has progressed from the conjunction of wireless knowledge, MEMS which is termed as micro electromechanical systems, micro facilities and the Internet. The conjunction has helped scratch down the storage walls concerning operating technology (OT) and information technology (IT), and allowing amorphous machine created data to be examined for understandings that will drive enhancements. The Things known as IOT is an arrangement of interconnected computing procedures, mechanical and digital machineries, substances or matters that are delivered with inimitable identifiers, and the ability to handover data over a system without necessitating human to humanoid, or human to computer collaboration. However, the security is one of the main concerns in Internet of things, which should be minimized. There are unnecessary requests from the attacker to overload the data center, which results in the hanging of the servers, decreasing the throughput, and requesting a transmission to the Data centers. This paper deals with an efficient approach to decrease the unwanted request at the Data Centers, so that the sessions will be reduced, and the unnecessary load will be reduced on the data centers, in order to mitigate the effect of attack as much as possible.

show abstract

“…In this scenario, to protect users' privacy, researchers have presented a variety of methods like privacy policy [5,6], distortion, encryption [7][8][9][10][11], and so on. Among these methods, distortion techniques, such as pseudonym, obfuscation, and dummy, are most widely used to protect privacy.…”

Section: Introductionmentioning

confidence: 99%

DGS-HSA: A Dummy Generation Scheme Adopting Hierarchical Structure of the Address

Wang

Yang

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

With the increasing convenience of location-based services (LBSs), there have been growing concerns about the risk of privacy leakage. We show that existing techniques fail to defend against a statistical attack meant to infer the user’s location privacy and query privacy, which is due to continuous queries that the same user sends in the same location in a short time, causing the user’s real location to appear consecutively more than once and the query content to be the same or similar in the neighboring query. They also fail to consider the hierarchical structure of the address, so locations in an anonymous group may be located in the same organization, resulting in leaking of the user’s organization information and reducing the privacy protection effect. This paper presents a dummy generation scheme, considering the hierarchical structure of the address (DGS-HSA). In our scheme, we introduce a novel meshing method, which divides the historical location dataset according to the administrative region division. We also choose dummies from the historical location dataset with the two-level grid structure to realize the protection of the user’s location, organization information, and query privacy. Moreover, we prove the feasibility of the presented scheme by solving the multi-objective optimization problem and give the user’s privacy protection parameters recommendation settings, which balance the privacy protection level and system overhead. Finally, we evaluate the effectiveness and the correctness of the DGS-HSA through theoretical analysis and extensive simulations.

show abstract

Efficient and Privacy-Preserving Polygons Spatial Query Framework for Location-Based Services

Cited by 51 publications

References 28 publications

Efficient Privacy-Preserving Data Sharing for Fog-Assisted Vehicular Sensor Networks

Efficient Privacy-Preserving Data Sharing for Fog-Assisted Vehicular Sensor Networks

An Efficient Approach for the Security Threats on Data Centers in IOT Environment

DGS-HSA: A Dummy Generation Scheme Adopting Hierarchical Structure of the Address

Contact Info

Product

Resources

About