Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

Privacy-preserving Cooperative Positioning

Authors: Hernandez, Guillermo; Lamountain, Gerald; Closas, Pau;

Privacy-preserving Cooperative Positioning

Abstract

We address the issue of user privacy in the context of “collaborative” positioning, wherein information is passed between and processed by multiple cooperative agents with the goal of achieving high levels of positioning accuracy. In particular, we evaluate the feasibility of applying a layer of encryption to a linear least squares (LS) algorithm for providing position, velocity, and time (PVT) estimates to a user based on information exchanged between neighboring receivers. The goal of such a scheme is to facilitate the requisite transfer and processing of GNSS measurements to achieve improved performance over single-user positioning, as demonstrated in the literature, for instance in mitigating errors induced by ionospheric propagation. Additionally, we wish to maintain that other agents or outside observers do not have access to the information required to locate a given user. We accomplish this by employing “homomorphic encryption” methodologies, in which fundamental mathematical operations may be performed on encrypted data to produce encrypted outputs, without providing access to either input or output to the agent performing the operation. The performance of the LS collaborative positioning methodology is evaluated both with and without encryption, and the results compared to each other as well as to the output of “single-user positioning” where information from other receivers is not used to mitigate the effects of atmospheric interferences. We show that the application of cooperative methodology results in an increase in performance under interference conditions, as compared to the single-user approach, and additionally that the application of homomorphic encryption to this LS approach yields little or no loss in estimation performance over the traditional, unencrypted cooperative LS algorithm.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    5
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
5
Top 10%
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!