<i>X</i>‐Region: A framework for location privacy preservation in mobile peer‐to‐peer networks

Che, Yanzhe; He, Qinming; Hong, Xiaobin; Chiew, Kevin

doi:10.1002/dac.2650

Cited by 7 publications

(7 citation statements)

References 34 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section evaluates the performance of our cloaking algorithms compared with the Dual-active [11], the EDA [12], and theX-region algorithm [14]. Our simulated data are generated by the Thomas Brinkhoff generator with a road network of Oldenburg which includes 6105 nodes and 7035 edges.…”

Section: Methodsmentioning

confidence: 99%

“…In this case, an adversary would easily collect others' locations if pretending to be a normal user. To this end, some cloaking algorithms without exposing the collaborators' locations to other peers in the P2P network have been proposed [13,14]. They all have limiations for relying on Wi-Fi received signal strength of adjacent peers or time difference of arrival of beacon signal and the collaborators' blurred region to form a CR.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A P2P Spatial-cloaking Algorithm without Exposing the Collaborators for LBS

Zhai¹

2016

Proceedings of the Fourth International Conference on Information Science and Cloud Computing — PoS(ISCC2015)

View full text Add to dashboard Cite

User's privacy issue is an important concern in Location-based Services (LBS) with widespread use. A well-known privacy preserving architecture for LBS is the Peer to Peer (P2P) model which allows users to collect other collaborators' locations through P2P network. Thus, it would incur the serious privacy disclosing if the users in P2P network maliciously collect those collaborators' locations. In this paper, we propose a spatial-cloaking algorithm which considers the being of the malicious collectors in P2P network. The key difference between our program and the existing schemes is that the collaborator map his location into an index which is not oneone mapping, so it can avoid the aforementioned issue in P2P network efficiently. In addition, our algorithm can also provide a personalized privacy-preserving for LBS in the road network. The experiment results show that our proposed algorithm is more efficient when it's compared to some existing work in terms of the communication cost, the anonymous time, the size of generated cloaking region and the success rate of anonymizing a location.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A P2P Spatial-cloaking Algorithm without Exposing the Collaborators for LBS

Zhai¹

2016

Proceedings of the Fourth International Conference on Information Science and Cloud Computing — PoS(ISCC2015)

View full text Add to dashboard Cite

show abstract

“…Mausaji [24] dwelt on the integrated auditing of ERP systems. Privacy and security have been analyzed and modeled in different systems (e.g., [27][28][29][30][31]61]). She and Thruanisingham [26] presented security solution in ERP and directions for secure systems.…”

Section: Background and Motivationmentioning

confidence: 99%

“…She and Thruanisingham [26] presented security solution in ERP and directions for secure systems. Privacy and security have been analyzed and modeled in different systems (e.g., [27][28][29][30][31]61]).…”

Section: Background and Motivationmentioning

confidence: 99%

Modeling privacy issues in distributed enterprise resource planning systems

Misra

Singh

Jha

et al. 2014

Int J Communication

View full text Add to dashboard Cite

With extensive usage and dependence on communication networks, 'privacy' issues in enterprise distributed systems have become fundamentally important. Privacy concerns have flooded the market especially in the public domain, and with the changing environment of software usage and involvement of malicious substances associated with any network, it becomes essential to safeguard and ascertain privacy among users and incorporate the same safeguard to protect privacy in software as well. The methodologies and tools architecting distributed enterprise resource planning (ERP) systems are primarily new and are vulnerable to malicious attacks. This paper aims at identifying some of critical privacy issues by collecting data from ERP practitioners. This work models variables associated with ERP with the variables of privacy to establish a robust adoption of ERP practices. Privacy issues concerning ERP are listed. Several variables associated with the development, implementation, and control of ERP are identified in the existing literature. A questionnaire instrument was distributed among a set of ERP practitioners. The response data collected thereby were analyzed statistically. Based upon the statistical analysis, an attempt has been made in the paper to make a ranking of the privacy factors. The observations are discussed in detail, and some specific conclusions have been made.

show abstract

“…A cloaked region needs to cover all users that reach the agreement and would be used as their locations in their requests. Some P2P schemes [13], [14] achieve location privacy without exposing precise locations between users, however, like most existing P2P schemes, they apply to ad-hoc or opportunistic networks.…”

Section: Introductionmentioning

confidence: 99%

Achieving User-Defined Location Privacy Preservation Using a P2P System

Liu

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

As location-based services become widely used in daily life, there is growing concern in preserving location privacy of users to avoid that attackers infer information about users by collecting and analyzing requests initiated by users. We argue that a good location privacy preservation scheme should have these properties. First, a user should never expose its precise location to any other entity. Second, a user should be able to specify its own requirement on the strength of privacy preservation, since a stricter preservation requirement may increase its overhead. Third, the scheme should be able to preserve as many as possible aspects of users' privacy under various attacks. With these desired properties in mind, we carefully design an encoding scheme of users' identifiers and a fully distributed architecture for our purpose and propose a privacy preservation scheme based on them. With the help of the encoding scheme and the distributed architecture, we develop a distributed negotiation algorithm to help users conduct negotiations among themselves to find their cloaked regions that satisfy their self-defined requirements without exposing their precise locations. The negotiations are completed without coordination from any central servers, and a random proxy is selected for each individual request, therefore the potential risks caused by any central server (location-based service servers or trusted-third-party servers) are mitigated as much as possible. Experiments show that our scheme can satisfy different strengths of privacy preservation required by each user even under the most severe scenarios.

show abstract

X‐Region: A framework for location privacy preservation in mobile peer‐to‐peer networks

Cited by 7 publications

References 34 publications

A P2P Spatial-cloaking Algorithm without Exposing the Collaborators for LBS

A P2P Spatial-cloaking Algorithm without Exposing the Collaborators for LBS

Modeling privacy issues in distributed enterprise resource planning systems

Achieving User-Defined Location Privacy Preservation Using a P2P System

Contact Info

Product

Resources

About