2PASS: Bandwidth-Optimized Location Cloaking for Anonymous Location-Based Services

Hu, Haibo; Xu, Jianliang

doi:10.1109/tpds.2010.26

Cited by 28 publications

(26 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To address this issue, Hossain et al [12] proposed H-Star based cloaking algorithm that can achieve high successful rate and reduce query processing cost. To the best of our knowledge, there exists only one research on result-aware location cloaking approach (called 2PASS), proposed by H. Hu and J. Xu [21]; based on client-server model that minimizes the number of requested objects directly. For this, they introduced (ì) weighted adjacency graph (WAG) that stores voronoi cell information and (ìì) WAG-tree indexing for computing the objects to request from the server.…”

Section: Cloaking-based Techniquementioning

confidence: 99%

“…Basically, 2PASS [21] is based on the notion of voronoi cells and each cell contains one object that is the nearest neighbor of any point in its cell. For example, Figure 3 triangulation of the space because these lines divide the space into partitions of spatial shape-triangles.…”

Section: Cloaking-based Techniquementioning

confidence: 99%

“…The location cloaking approach called 2PASS (2-Phase Asynchronous Search) [21] has been proposed that minimize the bandwidth usages as well as preserve user privacy. Basically, 2PASS follows client-server model.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we propose a weighted adjacency graph [21] based k-anonymous cloaking technique that can reduce bandwidth usages and provide protection to user. We follow user-cloaking-server model [3][4][5][6][7][8][9][10][11][12] where the trusted third party (location cloaker, LC) performs location cloaking for the user.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

K-Anonymous Cloaking Algorithm Based on Weighted Adjacency Graph for Preserving Location Privacy

Hossain

Jang

et al. 2012

2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

The propagation of position identifying devices, such as GPS (Global Positioning System), becomes increasingly a privacy threat in location-based services (LBSs). However, in order to enjoy such services, the user must precisely disclose his/her exact location to the LBS. So, it is a key challenge to efficiently preserve user's privacy while accessing LBS. For this, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, it suffers from privacy attack. Therefore, we aim to provide the solutions which can preserve user privacy by utilizing k-anonymity mechanism. In this paper, we propose a weighted adjacency graph based kanonymous cloaking technique that can provide protection to user and also reduce bandwidth usages. Our cloaking approach efficiently supports k-nearest neighbor queries without revealing private information of the query initiator. We demonstrate via experimental results that our algorithm yields much better performance than the existing one.

show abstract

Section: Cloaking-based Techniquementioning

confidence: 99%

Section: Cloaking-based Techniquementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

K-Anonymous Cloaking Algorithm Based on Weighted Adjacency Graph for Preserving Location Privacy

Hossain

Jang

et al. 2012

2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

show abstract

“…It tries to blur a user's exact location by generating a cloaking region which includes a query issuer and k-1 other users. Current research aligns on developing techniques to elaborate on k-anonymity [3][4][5][6][7][8]15] that process a user's query with protecting privacy during the access of LBSs. However, these kinds of approaches always rely on a location anonymizer to enlarge the cloaking region.…”

Section: Introductionmentioning

confidence: 99%

Privacy-area Aware All-dummy-based Location Privacy Algorithms for Location-based Services

Zhao¹,

Yi²,

Wan³

2017

dtcse

View full text Add to dashboard Cite

Abstract. Location-Based Services (LBSs) have become one of the most popular activities in our daily life. With the rapid advance of LBSs, there are more threats to users' privacy. For this reason, while enjoying the convenience provided by LBSs, we have to protect our location privacy. In this paper, we propose two all-dummy-based location privacy algorithms to achieve k-anonymity for privacy-area aware users in LBSs. Different from previous work, on the client side, our method can prevent the center attack and border attack through transforming the actual location to an anchor and the request we send to the LBSs doesn't contain the actual location of the user. On the server side, we use a rough query before precise query to reduce the processing time and transmission bandwidth. It only returns the results that the client needs. Evaluation results show that our methods can provide more effective privacy protection and lower computation and communication cost.

show abstract

Location Privacy-Preserving Scheme Based on Multiple Virtual Maps

Shen

Liang

Zhang

2018

Cloud Computing and Security

View full text Add to dashboard Cite

2PASS: Bandwidth-Optimized Location Cloaking for Anonymous Location-Based Services

Cited by 28 publications

References 29 publications

K-Anonymous Cloaking Algorithm Based on Weighted Adjacency Graph for Preserving Location Privacy

K-Anonymous Cloaking Algorithm Based on Weighted Adjacency Graph for Preserving Location Privacy

Privacy-area Aware All-dummy-based Location Privacy Algorithms for Location-based Services

Location Privacy-Preserving Scheme Based on Multiple Virtual Maps

Contact Info

Product

Resources

About