2018
DOI: 10.1016/j.future.2017.01.035
|View full text |Cite
|
Sign up to set email alerts
|

CenLocShare: A centralized privacy-preserving location-sharing system for mobile online social networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(22 citation statements)
references
References 25 publications
0
22
0
Order By: Relevance
“…In [48] authors proposed a mechanism called CenLoc-Share to address the above mentioned issues. Firstly, to overcome the issues caused by having two different servers was solved by combining the Social Network Server (SNS), and Location Based Server (LBS), into a single server called Location Storing Social Network Server (LSSNS).…”
Section: A Location Privacymentioning
confidence: 99%
“…In [48] authors proposed a mechanism called CenLoc-Share to address the above mentioned issues. Firstly, to overcome the issues caused by having two different servers was solved by combining the Social Network Server (SNS), and Location Based Server (LBS), into a single server called Location Storing Social Network Server (LSSNS).…”
Section: A Location Privacymentioning
confidence: 99%
“…Also, they incur a high transmission and storage cost [28], [32], [33], [29], [30]. To address this issue, very recently, Xiao et al proposed CenLocShare [34], where SNS and LBS were amalgamated into one single server. This scheme reduces communication cost, storage cost and also increases user's privacy protection.…”
Section: Related Workmentioning
confidence: 99%
“…In the defined graph, when every node has k-1 edges. The degree of K-anonymity may oppose the opponent with the background node degree knowledge [10]. As shown in Figure 2, the data collection is defined by degree d = {2, 2, 2, 2, 1} in unique graph of social networking (a) and the degree collection is d={2,2,2,2,2} in two-anonymity social network graph (b) with the addition of one edge among 2 and 5 node.…”
Section: K-anonymity In Social Networkingmentioning
confidence: 99%
“…Simple anonymity is considered as simplest technology of anonymity, in which the node information for identification is restored by insignificant symbols like 1, 2...3 etc. Figure 2 below defines simple anonymity publishing in social networking [10]. This research has utilized k-anonymity privacy protection model that helps to protect the data.…”
Section: Introductionmentioning
confidence: 99%