Privacy Preserving in Range-Based Cooperative Indoor Localization

Cooperative localization offers a potential solution to the limitation of anchor-deployment in range-based localization system. However, there is a huge risk of location leakage in the cooperative process. Several privacy-preserving schemes have been proposed to address this problem. Unfortunately, the inter-anchor communication makes these schemes unable to provide strong privacy guarantees. To tackle this issue, a secure and lightweight scheme based on partially homomorphic encryption is presented in this letter. Specifically, the least-squares estimation algorithm is decomposed into a form matching the additive homomorphism, so that each participated anchor can individually perform the encryption of its respective location-related information without interacting with others. During the entire localization process, private information of all entities involved remains secret, which could motivate users who have just done the positioning to participate in the localization, acting as pseudo-anchors for cooperative localization to solve the problem of dense anchor deployment. Experimental results and theoretical analysis have shown the proposed scheme meets the desired properties for a more pervasive use of indoor localization.

Authors

Institutions

Publication Details

Journal
IEEE Signal Processing Letters
Published
2025-01-01
DOI
https://doi.org/10.1109/lsp.2025.3591717
Primary Topic
Indoor and Outdoor Localization Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Privacy Preserving in Range-Based Cooperative Indoor Localization

Heng Yao, Shu Wang, Yanfen Le, Ruolan Lei
IEEE Signal Processing Letters
Indoor and Outdoor Localization Technologies
article

Privacy Preserving in Range-Based Cooperative Indoor Localization

Heng Yao, Shu Wang, Yanfen Le, Ruolan Lei
article en

Abstract

Cooperative localization offers a potential solution to the limitation of anchor-deployment in range-based localization system. However, there is a huge risk of location leakage in the cooperative process. Several privacy-preserving schemes have been proposed to address this problem. Unfortunately, the inter-anchor communication makes these schemes unable to provide strong privacy guarantees. To tackle this issue, a secure and lightweight scheme based on partially homomorphic encryption is presented in this letter. Specifically, the least-squares estimation algorithm is decomposed into a form matching the additive homomorphism, so that each participated anchor can individually perform the encryption of its respective location-related information without interacting with others. During the entire localization process, private information of all entities involved remains secret, which could motivate users who have just done the positioning to participate in the localization, acting as pseudo-anchors for cooperative localization to solve the problem of dense anchor deployment. Experimental results and theoretical analysis have shown the proposed scheme meets the desired properties for a more pervasive use of indoor localization.

IEEE Signal Processing LettersVol. 32
University of Shanghai for Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 84%
Indoor and Outdoor Localization Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.