2020
DOI: 10.1109/access.2020.2995504
|View full text |Cite
|
Sign up to set email alerts
|

Location Privacy Preservation Mechanism for Location-Based Service With Incomplete Location Data

Abstract: The Location-Based Service has been widely used for mobile communication networks and location systems. However, privacy disclosure for incomplete collection location data in LBS was ignored in most of the existing works. To solve the problem of privacy disclosure, we propose a location privacy method based k-anonymity to prevent privacy disclosure in LBS constrained in incomplete data collection. The proposed scheme can provide effectively location privacy-preserving in the process of constructing the anonymo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(19 citation statements)
references
References 31 publications
0
19
0
Order By: Relevance
“…Hilbert curve can be used to build a set of candidate cloaking regions as adopted in ( [40], [41], and [42], by rotating and shifting the Hilbert curve around the centre point of the data space. A randomization algorithm (such as the exponential mechanism) is used to selected from the cloaking regions candidates using a score function (such as the cloaking region size).…”
Section: Anonymity-based Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Hilbert curve can be used to build a set of candidate cloaking regions as adopted in ( [40], [41], and [42], by rotating and shifting the Hilbert curve around the centre point of the data space. A randomization algorithm (such as the exponential mechanism) is used to selected from the cloaking regions candidates using a score function (such as the cloaking region size).…”
Section: Anonymity-based Methodsmentioning
confidence: 99%
“…Anonymity-based methods [40], [41], and [42] The indistinguishability is between locations of multiple users (C3) The need for an anonymizer that collects the locations of multiple users may create privacy attack opportunities.…”
Section: Challengesmentioning
confidence: 99%
“…Zhang et al generated dummy locations by taking the road network correlations into account [28]. Yang et al [29] considered the reachability constraint, i.e., a type of temporal correlation between continually released locations when generating the dummy locations. In addition, to protect users' real locations against inference attacks based on location semantics, Sun et al [30] generated dummy locations that shared nearly equivalent query probabilities.…”
Section: A Protection Of Location Privacymentioning
confidence: 99%
“…In addition, the model is built based on the obfuscated trajectory itself, resulting in a dependency on the LPPM used to generate the obfuscated trajectory. Other attacks exploit temporal correlations, such as continuity of a user's movement [12], [29], [35] and road constraints [19].…”
Section: B Attacks On Location Privacymentioning
confidence: 99%
“…At the same time, the generation of dummy locations does not need a trustable third-party server. In recent years, many location privacy-preservation methods based on dummy locations have been proposed [15][16][17][18][19][20][21][22][23]. However, due to the characteristics of vehicles, the location of vehicles is subject to the road distribution, many methods cannot be directly adopted in IoV.…”
Section: Introductionmentioning
confidence: 99%