Proof-of-Location (PoL)

• Proof-of-Location (PoL) is a protocol that enables a prover to generate cryptographically bound location claims, asserting presence at a specific region and time interval.
• Systems employ diverse architectures—from blockchain-based and infrastructure-assisted to encounter-based—to ensure authenticity, integrity, and privacy in location proofs.
• Robust threat mitigation is achieved through mechanisms like distance bounding, replay protection, and consensus on event ordering to counter spoofing and collusion.

Proof-of-Location (PoL) denotes a class of protocols that transform a location claim into a verifiable proof that binds an entity, a place or region, and a time interval under explicit security, trust, and privacy assumptions. Across the literature, PoL appears as a cryptographic statement that a prover was present “at region (R) at time (t),” as a certificate that a device’s true location (\ell_d(t)) lay within a region (S\subset\mathbb{R}^2), as an evidence object carrying quorum attestations over a block interval, and as a proof object (\pi) checked by a verifier through a (\text{Setup}), (\text{Prove}), (\text{Verify}) interface [2508.14230] [2404.04297] [2603.27883] [2604.13668]. The common objective is to replace self-asserted coordinates with evidence-bearing claims that support authenticity, integrity, freshness, and, in many systems, privacy preservation.

1. Definitions and conceptual scope

The most compact formulation in the surveyed literature defines PoL as a protocol enabling a prover (\mathcal{P}) to generate a cryptographically bound statement that “(\mathcal{P}) was at region (R) at time (t)” such that a verifier (\mathcal{V}), possibly assisted by witnesses ({\mathcal{W}_i}), can check the claim with overwhelming assurance [2508.14230]. A more abstract formulation models PoL as a scheme (\Pi) with procedures (\text{Setup}(1^\lambda)\to \text{params}), (\text{Prove}(P,L,\Delta t,\text{params})\to \pi), and (\text{Verify}(V,\pi,L^*,\Delta t^*,\text{params})\to{\text{accept},\text{reject}}), where (L) may be a designated region or point and (\Delta t=[t_0,t_1]) is a time window [2604.13668].

The literature distinguishes several semantics for the object being proved. In “precise” formulations, the claim concerns an exact point. In ProLoc, the claim is deliberately relaxed to a “region proof,” asserting that a device’s true location satisfies (\ell_d(t)\in S), including the common special case (|\ell_d(t)-L_0|\le r) for a circular region (S=B(L_0,r)) [2404.04297]. In secure location provenance, the object of interest is not only a single proof of presence but a chronological history of location proofs that can later be selectively disclosed to an auditor [1107.1821]. In witnessing-zone architectures, the PoL is an evidence object
[
\mathcal{E}{T_i}(c)=\langle b_i,\;c,\;{R_j}{j\in Q},\;\sigma_Q,\;v,\;Z_z\rangle,
]
which binds a claim (c), a finalized block hash (b_i), witness commitments ({R_j}), an aggregated quorum signature (\sigma_Q), a policy version (v), and a zone identifier (Z_z) [2603.27883].

This diversity indicates that PoL is not a single protocol family but a design space. The taxonomy literature organizes that space along four domains: cryptographic guarantees, spatio-temporal synchronization, trust and witness models, and interaction and overhead [2508.14230]. A plausible implication is that disagreements in the literature about what counts as a “proof of location” often arise from different assumptions about precision, verifiability horizon, and disclosure requirements rather than from incompatible security goals.

2. Threat models and security objectives

PoL systems are typically specified against adversaries that can falsify position, replay stale evidence, collude with witnesses, or exploit protocol asymmetries. In IoT sensor networks, the adversary may compromise a subset of nodes or impersonate identities in Sybil attacks, inject, replay, or modify messages, and flood the network with spurious messages under valid or spoofed IDs [2302.14713]. In location-proof services built from user devices, the adversary may control a limited number (c) of physical devices, create unlimited virtual devices, fabricate entire histories, and mount retroactive attacks in which the target region (S) and time (t) are unknown in advance [2404.04297]. In UAV settings, the explicit threat model includes GNSS spoofing, relay attack (“Wormhole”), and identity spoofing [2304.00795]. In cyber-physical witnessing zones, the catalog expands to distance fraud, scene spoofing, sensor spoofing, and collusion compromising at least (k) witnesses [2603.27883].

Despite these differences, the core security objectives are stable. The taxonomy paper states completeness and soundness in the standard interactive-proof sense, then refines soundness into proximity soundness and temporal soundness, and adds authenticity, integrity, and, in distributed settings, consensus on event ordering [2508.14230]. ProLoc states the same goals operationally as soundness (“no false positives”) and completeness (“no false negatives”), with soundness requiring that an adversarial prover outside (S) cannot pass (\texttt{prove_loc}) except through colluding witnesses with plausible trajectories and encounter traces [2404.04297]. In IoT zk-PoL, soundness is phrased as extractability under the Knowledge-of-Exponent Assumption, with zero-knowledge requiring that the proof reveals nothing beyond the exposed public parameters [2406.18389].

A broader provenance perspective frames these security properties through four integrity axes: claim integrity, evidence integrity, control integrity, and governance integrity. On that view, recurrent failure modes include fabricated locality, replay and re-contextualisation, proxying and delegated control, origin laundering and documentary substitution, signal manipulation and interference, record opacity and asymmetric access, and jurisdiction ambiguity and inference overreach [2604.13668]. This suggests that PoL is increasingly treated not merely as a localization primitive but as part of a larger evidentiary and governance stack.

3. Protocol architectures and witness models

PoL protocols differ sharply in who witnesses location and how attestation is produced.

Family	Core mechanism	Representative papers
Witness-endorsed and provenance-oriented	Authority-issued proof plus third-party endorsement and chronology protection	[1107.1821]
Blockchain-backed decentralized PoL	Peer witnesses, signed proofs, ledger recording, consensus	[1607.00174]
Infrastructure-assisted ranging	UWB anchors or APs validate proximity and sign proof data	[2304.00795] [2503.02019]
Encounter- and hindsight-based proofs	Short-range encounters plus uploaded histories reconstruct feasible regions	[2404.04297]
Mesh and quorum-based PoL	Multiple fixed witnesses form threshold attestations or BFT consensus	[2603.27883]
Delay-based Internet PoL	Signed RTT measurements plus Byzantine-resistant geometry	[2403.13230]

The witness-endorsed architecture for secure location provenance introduces four roles: user (U), location authority (L), witness (w), and auditor (A). The authority signs a location statement (LS_i=\langle U,L,t_i\rangle), and a co-located witness creates an endorsement statement (ES_i=\langle w,U,L,t_i,h(LP_i)\rangle), enabling an auditor to check the authority signature, witness endorsement, timestamp consistency, and chronological ordering [1107.1821]. The design target is collusion resistance together with selective disclosure of arbitrary subsequences of a location history.

The 2016 blockchain design removes central storage and records PoLs in a public ledger. A prover broadcasts a signed request (\text{Req}{i\to j}={K_i^{pu}\parallel L_i\parallel h(\text{Block}{t-1})\parallel t_i}_{\text{Sign with }K_i^{pr}}), a nearby witness verifies overlay-neighbor and distance conditions, then replies with a signed response that is later propagated and stored in blocks under a Proof-of-Stake variant [1607.00174]. This architecture treats the blockchain simultaneously as integrity mechanism, global dissemination substrate, and consensus layer.

In UWB-based PoL for UAVs, witness functionality is transferred to ground anchors at known, pre-surveyed positions. A UAV submits a ProofRequest, engages in double-sided UWB two-way ranging, and a platform submits ProofResponse{ uavID, platformID, nonce, {d_i}, GPSclaim }; chaincode VerifyPoL then checks whether the triangulated UWB position agrees with the claimed GPS within a pre-configured tolerance (\delta) [2304.00795]. This is a verifier-managed model with strong infrastructure assumptions.

ProLoc occupies a different point in the design space. It collects GPS-derived trajectories and short-range radio encounter histories, then reconstructs feasible regions for the prover from witness trajectories, encounter times, BLE range, and map isochrones. A verifier supplies (S), (t), an anchor set (\mathcal{A}), and a threshold (N), and the backend returns “true” only if at least (N) valid witnesses satisfy (R_i\subseteq S) [2404.04297]. The proof is thus retrospective and computationally reconstructed rather than interaction-timed at the point of presence.

The witnessing-zone architecture advances a threshold model in which (n) fixed-position witness nodes form a fully-connected, non-hierarchical mesh over a zone of radius (R). During each block interval (T_i), each witness runs distance bounding, optionally samples contextual features (\phi_j), evaluates a policy predicate (\mathsf{Admit}_v(c,\phi_P,\phi_j,db_j)), commits local evidence in a Merkle root (R_j), signs (\mathsf{Sign}_j(b_i,c,R_j,v,Z_z)), and a (k)-of-(n) quorum admits the claim into block (b_i) [2603.27883]. This architecture explicitly integrates presence proof, policy enforcement, and ledger finalization.

4. Measurement and cryptographic mechanisms

The physical substrate of PoL varies from short-range radio and GPS to Internet delay and, in quantum formulations, position verification.

In lightweight IoT PoL, RSSI is converted into estimated distances through a path-loss model,
[
d_{xy}=f(RSSI_{xy})=10^{(P_0-RSSI_{xy})/(10\cdot n)},
]
and a node reconstructs a claimed sender’s location (\hat l_j) by multilateration from stored RSSI histories [2302.14713]. A location-bound key (LKey_i=H(ID_i\parallel l_i)) and signature (Sig_i(p)=H(p\parallel LKey_i)) permit lightweight verification without introducing heavy asymmetric cryptography into low-rate mesh networks [2302.14713].

ProLoc constructs region proofs from short-range radio encounters and trajectory data. If a witness (w) reported locations at times (t_w) and (t_w'), and encountered the prover at (t_e) within BLE range (r_{\mathrm{BLE}}), the system computes two witness-to-prover feasible regions using isochrones and Minkowski sums, propagates them to time (t), and obtains a feasible region (R). The witness is valid if (R\subseteq S), and the backend requires at least (N) such witnesses whose combined feasible region still lies in (S) [2404.04297]. The essential measurement primitive is therefore encounter evidence plus bounded mobility over a map.

UWB-based systems rely on precise timing rather than signal strength. In the UAV design, double-sided TWR yields a one-way time-of-flight (\tau), and the distance estimate is (d=c\cdot\tau), where (c\approx3\times10^8) m/s [2304.00795]. Because the protocol binds IDs and nonces to the ranging exchange and stores session data on-chain, the measurement is coupled to both physical timing and authenticated identity [2304.00795].

Delay-based Internet PoL follows a different strategy. BFT-PoLoc signs ping packets, hashes packet chains for replay resistance, and uses each challenger’s monotone mapping (F_i:\text{RTT}\mapsto) maximum-possible distance to convert measured RTTs into conservative distance upper bounds [2403.13230]. Byzantine resistance is obtained through ratio-based filtering and low-rank matrix completion solving
[
\min_{L,C}\ |L|*+\lambda|C|{1,2}
\quad \text{subject to } P_E(L+C)=P_E(M_{\text{observed}}),
]
followed by Euclidean geometric constraints to bound the deviation (R^*) between the claimed and true locations [2403.13230].

Privacy-preserving PoL replaces or supplements direct coordinate disclosure with commitments and zero-knowledge proofs. The IoT zk-PoL paper defines an NP relation over on-chain digest (dig_i=\text{Hash}(pk_i\parallel\langle lat,lon\rangle_i\parallel rand_i\parallel time_i)) and one-time-use hash (hr_i=\text{Hash}(rand_i)), and instantiates a QAP-based zk-SNARK in the Pinocchio style [2406.18389]. The vehicle-subsidy and taxation work commits a GPS trail (S) with Poseidon, has a witness device sign (Sign_{sk_w}(session_id\parallel H_S)), and proves policy predicates such as total distance and within-territory covered distance in zero knowledge [2506.16812]. At the far end of the spectrum, “Private Proofs of When and Where” introduces position commitments and zero-knowledge position verification built from quantum position verification and post-quantum one-way functions, allowing proofs of statements such as being or not being near a location at a given time without revealing any other detail about the true location [2601.18961].

5. Consensus, anti-collusion, and privacy preservation

A persistent difficulty in PoL is that witnesses may be malicious, colluding, or fictitious. The literature therefore develops multiple anti-collusion mechanisms rather than assuming a single trusted verifier.

In IoT PoL, distrust is driven by local trust scores and Byzantine-fault-tolerant challenge messages. A node (i) enters distrust toward (j) when (Trust_i(j)<\epsilon) or the number of distinct BFT messages about (j) exceeds (\tau). On a valid alert from a trusted node (X), (i) decrements (Trust_i(j)) if it accepts the alert, otherwise decrements (Trust_i(X)), while incrementing trust for witnesses whose BFT messages it has observed [2302.14713]. This is a neighborhood-consensus model in which trust emerges from repeated local verification.

ProLoc addresses collusion among attacker-controlled devices through a variant of TrustRank over the encounter graph. Vertices are device IDs, and a directed edge ((g\leftarrow d)) of weight (e(g,d)) exists if (g) received BLE adverts from (d). Edge weights are diluted in overlapping windows so that if device (g) receives adverts from (k) peers in a window, each contributing peer adds (\Delta e(g,d)=\frac{1}{k^L}|W|) with (L>1), penalizing Sybil multiplicity [2404.04297]. TrustRank then solves
[
\mathbf{t}=\alpha \mathbf{A}\mathbf{t}+(1-\alpha)\mathbf{v},
]
with seed set (\mathcal{A}), and witnesses with (t_w<T) are discarded [2404.04297]. The stated effect is that fictitious realms connected only through a small cut of corrupt devices receive negligible TrustRank mass.

The 2016 blockchain design instead uses graph-theoretic betweenness centrality to identify Sybil clusters. Large Sybil groups can accumulate PoLs only if they stay local long enough, but their PoL graph exhibits low betweenness centrality (B(v)); low-(B) nodes are flagged and their PoLs discarded [1607.00174]. In VANETs, Sybil resistance is obtained through a combination of threshold-signed RSU location tags, proof-of-work puzzles that must be solved between consecutive RSUs, and clique-based trajectory matching that exploits the physical overlap of trajectories created by a single car [1904.05845].

Privacy preservation is equally diverse. The anonymous proof-of-location algorithm for peer-to-peer energy trading issues a Certificate-of-Location over a Merkle root (\mathit{MTR}_A) of ephemeral public keys, then presents a proof
[
\pi_A=(\mathsf{CoL}_A,\mathit{PK}_B,\mathsf{Sig}_B,\mathit{MTR}_A,\sigma_A,\mathit{PK}_A^{(j)},\mathit{MTL}_A^{(j)},\mathsf{Sig}_A^{(j)}),
]
so that the location claim is bound to a fresh pseudonym rather than the long-term smart-meter key [2005.14520]. The paper states that A-PoL yields (k)-anonymity among the (N) leaves in (\mathit{MTR}_A) [2005.14520]. SLAP combines SPSEQ-UC anonymous credentials, BBS group signatures, distance-bounding, and time-lock puzzles, and supports both AP-based and nearby-device-based location verification while maintaining full user anonymity and location privacy during spectrum access [2503.02019]. The broader provenance literature accordingly treats “purpose-bound” and “selective disclosure” as baseline requirements for PoL in privacy-sensitive settings [2604.13668].

6. Evaluation, applications, limitations, and open directions

Empirical evaluation across the literature shows that PoL performance depends strongly on the sensing substrate, witness density, and privacy mechanism.

For lightweight IoT PoL implemented on Particle Xenon boards with Zephyr RTOS and OpenThread, a median-plus-Kalman RSSI filter eliminated false BFTs under static conditions; on each genuine movement, each neighbor emitted 1–2 BFT messages within 5 s; total BFT overhead was (<10\%) of payload traffic in the test scenario; and no false alerts were observed [2302.14713]. This indicates feasibility on resource-constrained hardware, though the same work identifies unfinished tasks such as full alert handling, multi-hop consensus propagation, and formal specification or model checking [2302.14713].

For ProLoc, simulated Copenhagen mobility with 128 k participating users and the SensibleDTU BLE dataset showed that, with 20% adoption and 3 min reporting, median precision radii rise from (\sim75) m at (N=1) to (\sim500) m at (N=5), and even at (N=10), the 90%ile radius remains (<1) km in dense areas [2404.04297]. TrustRank on the 850-node graph runs in (<1) min, while isochrone proofs were dominated by map queries at (\sim23) s per witness on un-optimized Python [2404.04297]. The result is useful for applications that accept bounded regional presence rather than exact point verification, such as ranking citizen reports near an earthquake, protest, or fire by their proof precision [2404.04297].

The UWB-UAV prototype reports short-range ranging error samples of 0.09 m and 0.045 m at (\sim3)–4 m, and long-range errors of 0.25 m and 0.16 m at (\sim12)–14 m, all within a 1 m tolerance [2304.00795]. Its principal limitations are UWB range constraints, degradation under non-line-of-sight, and the need to scale a Fabric deployment beyond a single channel with two peers [2304.00795]. The witnessing-zone simulation, by contrast, emphasizes robustness: with (R=20) m, (n=4), (k=3), and 1 000 Monte Carlo iterations per scenario, the baseline and valid-visual scenarios achieved precision 1.00, while distance fraud and invalid-visual scenarios admitted (0.0/30) claims [2603.27883]. The trade-off explicitly noted there is that contextual sensing adds latency and compute at witnesses but raises spoofing costs [2603.27883].

Zero-knowledge PoL systems show a different performance profile. The IoT zk-PoL reports total repeatable time of approximately 2 minutes per service request on a MateBook 13, with proof size fixed at 8 group elements and verifier time (O(1)) in the number of constraints, and notes that computational efficiency is independent of the hierarchical privacy level selected by the user [2406.18389]. The vehicle-subsidy and taxation system scales linearly in trajectory length and number of shapes, with EV subsidy proof generation times of (12.0\pm0.15) s for 200 points, (47.3\pm0.33) s for 3600 points, and (1229\pm17.1) s for 43 800 points on a Raspberry Pi 4 in the MnC backend [2506.16812]. These results are consistent with the claim that such protocols are appropriate where verification can be delayed and privacy dominates latency constraints.

Applications span location-based services, access control, spectrum access, UAV remote identification, citizen journalism, peer-to-peer energy trading, VANET Sybil detection, supply-chain auditing, and physical e-voting [1607.00174] [2503.02019] [2304.00795] [2404.04297] [2005.14520] [1904.05845] [2508.14230]. The methodological literature therefore recommends selecting PoL architectures by matching application requirements to the four design domains rather than assuming that one protocol shape generalizes across use cases [2508.14230].

Open research directions recur across the corpus. They include integrating alternative ranging technologies such as UWB time-of-flight, adapting PoL for mobile nodes, analyzing collusion attacks by multiple compromised nodes, studying scalability of witness thresholds under changing density, managing policy versioning and cross-zone interoperability, improving privacy-preserving policy verification, and standardizing interfaces and formats for governance-grade auditability [2302.14713] [2603.27883] [2604.13668] [2506.16812]. A plausible implication is that future PoL systems will increasingly combine physical measurement, distributed witness logic, privacy-preserving cryptography, and dispute-oriented evidence management rather than treating location verification as a standalone sensing problem.