English

VerLoc: Verifiable Localization in Decentralized Systems

Cryptography and Security 2021-10-04 v3

Abstract

We tackle the challenge of reliably determining the geo-location of nodes in decentralized networks, considering adversarial settings and without depending on any trusted landmarks. In particular, we consider active adversaries that control a subset of nodes, announce false locations and strategically manipulate measurements. To address this problem we propose, implement and evaluate VerLoc, a system that allows verifying the claimed geo-locations of network nodes in a fully decentralized manner. VerLoc securely schedules roundtrip time (RTT) measurements between randomly chosen pairs of nodes. Trilateration is then applied to the set of measurements to verify claimed geo-locations. We evaluate VerLoc both with simulations and in the wild using a prototype implementation integrated in the Nym network (currently run by thousands of nodes). We find that VerLoc can localize nodes in the wild with a median error of 60 km, and that in attack simulations it is capable of detecting and filtering out adversarial timing manipulations for network setups with up to 20 % malicious nodes.

Cite

@article{arxiv.2105.11928,
  title  = {VerLoc: Verifiable Localization in Decentralized Systems},
  author = {Katharina Kohls and Claudia Diaz},
  journal= {arXiv preprint arXiv:2105.11928},
  year   = {2021}
}
R2 v1 2026-06-24T02:26:54.453Z