scholarly journals A caching and spatialK-anonymity driven privacy enhancement scheme in continuous location-based services

2019 ◽  
Vol 94 ◽  
pp. 40-50 ◽  
Author(s):  
Shaobo Zhang ◽  
Xiong Li ◽  
Zhiyuan Tan ◽  
Tao Peng ◽  
Guojun Wang
Electronics ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 148 ◽  
Author(s):  
Qiong Wu ◽  
Hanxu Liu ◽  
Cui Zhang ◽  
Qiang Fan ◽  
Zhengquan Li ◽  
...  

With the proliferation of the Internet-of-Things (IoT), the users’ trajectory data containing privacy information in the IoT systems are easily exposed to the adversaries in continuous location-based services (LBSs) and trajectory publication. Existing trajectory protection schemes generate dummy trajectories without considering the user mobility pattern accurately. This would cause that the adversaries can easily exclude the dummy trajectories according to the obtained geographic feature information. In this paper, the continuous location entropy and the trajectory entropy are defined based on the gravity mobility model to measure the level of trajectory protection. Then, two trajectory protection schemes are proposed based on the defined entropy metrics to protect the trajectory data in continuous LBSs and trajectory publication, respectively. Experimental results demonstrate that the proposed schemes have a higher level than the enhanced dummy-location selection (enhance-DLS) scheme and the random scheme.


2020 ◽  
Vol 527 ◽  
pp. 406-419 ◽  
Author(s):  
Shaobo Zhang ◽  
Xinjun Mao ◽  
Kim-Kwang Raymond Choo ◽  
Tao Peng ◽  
Guojun Wang

Location Based Services anticipate that customers should continually report their zone to a possibly untrusted server to get organizations reliant on their territory, which can open them to security risks. Tragically, existing security defending strategies for LBS have a couple of requirements, for instance, requiring a totally trusted in outcast, offering confined insurance confirmations and realizing high correspondence overhead. In this errand, A customer portrayed security organize structure called dynamic grid system (DGS) is proposed; the important sweeping structure that fulfills four central requirements for insurance shielding delineation and industrious LBS. The structure just requires a semi-trusted in outcast, at risk for doing clear planning undertakings viably. This semi-accepted pariah doesn't have any information about a customer's region. Secure delineation and steady zone assurance is guaranteed under the described enemy models. The correspondence cost for the customer doesn't depend upon the customer's optimal insurance level, it just depends upon the amount of huge central focuses in the area of the customer. Notwithstanding the way that the consideration is on range and k-nearest neighbor requests in this work, This structure can be easily connected with assistance other spatial inquiries without changing the estimations run by the semi-trusted in outcast and the database server, gave the essential interest an area of a spatial request can be engrossed into spatial regions. Experimental results show that the DGS is more productive than the best in class protection saving strategy for LBS.


2015 ◽  
Vol 14 (10) ◽  
pp. 2158-2172 ◽  
Author(s):  
Roman Schlegel ◽  
Chi-Yin Chow ◽  
Qiong Huang ◽  
Duncan S. Wong

Author(s):  
Yang Cao ◽  
Yonghui Xiao ◽  
Li Xiong ◽  
Liquan Bai ◽  
Masatoshi Yoshikawa

Sign in / Sign up

Export Citation Format

Share Document