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

A Secure and Efficient Privacy-Preserving Range Query Scheme in Location-Based Services

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…The following year, according to the autocorrelation of location privacy, Li et al [26] analysed the relationship between location units and query content from the time dimension and proposed an anonymous query content generation algorithm. Huang et al [27] proposed a secure and efficient LBS privacy-preserving range query protocol that meets the three requirements of location privacy and content privacy protection, query efficiency, and scalable index size. Peng et al [28] proposed a multidimensional privacy preservation (MPP) scheme that provides full protection for user privacy without any need for a trusted third party (TTP).…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The following year, according to the autocorrelation of location privacy, Li et al [26] analysed the relationship between location units and query content from the time dimension and proposed an anonymous query content generation algorithm. Huang et al [27] proposed a secure and efficient LBS privacy-preserving range query protocol that meets the three requirements of location privacy and content privacy protection, query efficiency, and scalable index size. Peng et al [28] proposed a multidimensional privacy preservation (MPP) scheme that provides full protection for user privacy without any need for a trusted third party (TTP).…”
Section: Related Workmentioning
confidence: 99%
“…Huang et al. [27] proposed a secure and efficient LBS privacy‐preserving range query protocol that meets the three requirements of location privacy and content privacy protection, query efficiency, and scalable index size. Peng et al.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Huang et al [15] proposed a scheme to realize the content privacy and location privacy to encode index elements by adopting scheme called prefix membership verification. Different encoding elements are DBtree construction algorithm, query processing algorithm and trapdoor generation.…”
Section: Related Workmentioning
confidence: 99%