.png){kind=icon}
Return
Analyzing and Evaluating Efficient Privacy-Preserving Localization for Pervasive Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/JIOT.2017.2772291.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Privacy-preserving localization in crowdsourcing has drawn much attention recently. Under the classical non-adjacent subtraction-based localization (NSL) model, existing solutions based on homomorphic encryption techniques are of high computational and communication overheads. In this paper, an adjacent subtraction-based localization (ASL) model is first proposed. Then, an efficient privacy-preserving localization (EPPL) algorithm is developed under ASL without using any homomorphic encryption technique. In terms of the correctness, privacy, and efficiency, a comprehensive analysis is presented to investigate EPPL's performance. Furthermore, the statistical equivalence between ASL and NSL is proved through the fact that the difference between their average location estimation results converges toward zero. The lower and upper bounds of the localization error are also derived for ASL under a bounded noise model. Extensive simulations are conducted to illustrate the equivalence between ASL and NSL, and the performance of EPPL regarding the correctness, privacy, and efficiency.
Keywords:
Analysis and evaluation
crowdsourcing localization
pervasive computing
privacy preserving
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
1.4W
Citations:
7.8W
Organization
Cited Papers
Noisy Range Network Localization Based on Distributed Multidimensional Scaling.png)
IEEE SENSORS JOURNAL
OAAI
IEEE SENSORS JOURNALIF4.5
OAAIShareSaveShareSaveShareSaveShareSaveMinimization of the effect of noisy measurements on localization of multi-agent autonomous formationsAUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSave
View more