Pairwise Secret Key Agreement based on Location-derived Common Randomness
Somayeh Salimi, Panos Papadimitratos

TL;DR
This paper investigates secret key sharing among three users using location-derived common randomness, providing bounds on capacity regions and analyzing a Gaussian observation model for practical localization-based key agreement.
Contribution
It introduces a new framework for pairwise secret key agreement utilizing location-based observations and derives capacity bounds for this setup.
Findings
Inner bound on secret key capacity region established
Analysis of Gaussian observation model for localization-based keys
Practical insights into location-derived secret key sharing
Abstract
A source model of key sharing between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. There are rate-limited public channels for communications between the users. We give an inner bound on the secret key capacity region in this framework. Moreover, we investigate a practical setup in which localization information of the users as the correlated observations are exploited to share pairwise keys between the users. The inner and outer bounds of the key capacity region are analyzed in this setup for the case of i.i.d. Gaussian observations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Security in Wireless Sensor Networks · Chaos-based Image/Signal Encryption
