Search arXivSearch

arXiv · 2608.29371

Who Resolves Your DNS? Measuring Resolver Opacity and Closing the Visibility Gap

Abstract

DNS resolution has no notion of a verifiable resolver path. When an ISP outsources resolution to a third-party provider, a user's queries can cross organizational and national boundaries without their awareness---and the client that issued them has no protocol mechanism to learn which resolvers handled the query, where they sat, or who operated them. We argue that this opacity is an architectural gap rather than a deployment accident, and that a reported, verifiable resolver path should be a first-class goal of the resolution protocol. We motivate this with measurement and then show the gap is cheap to close. Using RIPE Atlas across 190 countries, we find that resolution routinely leaves the client's organization and country: under a conservative in-AS treatment of unattributable observations, 39.8% of observed resolver chains (6,622 of 16,636) use a frontend in a different AS than the client, one in four geolocatable anycast frontend pairs resolves outside the client's country, and a single operator---Google Public DNS---accounts for roughly two-thirds of those out-of-country cases. We then present Resolver-Path, an approach in which participating resolvers report their identity as they forward the query. Its base layer is cooperative in-band disclosure, it carries resolver-path metadata at near-neutral throughput, latency, and CPU cost. Because a non-participating resolver can ignore or strip the option, disclosure alone establishes the verifiable presence of reported hops, not the absence of hidden ones. Attestation authenticates the integrity, ordering, and freshness of the cooperative assertions carried by the selected response. Together, disclosure and attestation provide bounded evidence about the selected response's reported resolver chain---the substrate DNS currently lacks for jurisdictional accountability.

Explore related subjects

Keep this discovery

BibTeXRIS

Kedar Thiagarajan, Fabian E. Bustamante. 2026-08-29. Who Resolves Your DNS? Measuring Resolver Opacity and Closing the Visibility Gap. https://arxiv.org/abs/2608.29371

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

AEGIS: Risk-Budgeted Online Scheduling for Resilient Continuous Edge Inference

Continuous edge inference requires sustained wireless and computing support across successive service instances. Under recurring channel degradation, transient edge overload, and multi-user contention, isolated deadline misses may accumulate into persistent service degradation. Existing schedulers mainly optimize instantaneous latency or per-timeslot utility and provide limited control over such cross-time effects. To address this issue, we propose AEGIS (Adaptive Exposure-Governed Inference Scheduling), a risk-budgeted online framework for service-level operational resilience. AEGIS regulates predicted deadline-risk exposure through dynamically replenished per-user risk budgets and establishes an explicit finite-horizon bound on cumulative admitted-risk exposure. One-step state estimation supports anticipatory delay and risk assessment, while the centralized bandwidth--computing allocation is transformed into an exact-potential formulation and solved through asynchronous coordinate updates. Simulation results demonstrate that AEGIS enhances timely-service continuity, contains persistent deadline violations, and improves post-stress recovery through adaptive cross-time risk regulation. Meanwhile, it effectively controls predicted-risk exposure while preserving competitive service performance, achieving a favorable balance between service resilience and risk control.

cs.NI

Enhancing Network Resilience via Graph-Based Anomaly Detection in Sovereign Functions

Sovereign network functions, e.g., routing protocols, are becoming increasingly complex and susceptible to failures arising from protocol configuration anomalies and anomalous configurations. This paper interprets the protocol configuration anomaly detection problem as detection of structural inconsistencies of connected nodes and edges in a bipartite graph that captures both physical network entities and logical protocol states. This graph structural inconsistency detector (GSID) model is proposed to solve the problem efficiently. To handle the heterogeneous nature of protocol configuration parameters, GSID employs an adaptive configuration encoder (ACE) that dynamically selects encoding strategies per parameter to preserve fine-grained numerical discrepancies. To expose the subtle inconsistencies of connected nodes and edges in the bipartite graph, GSID uses an inconsistency dynamic attention (IDA) mechanism that scores edges by drawing asymmetric attentions from both ends, rule compliance from one end and route connectivity from the other. It is demonstrated experimentally that GSID outperforms state-of-the-art baselines by threefold in F1 score and by 23.2% in accuracy. Ablation studies validate the effectiveness of both the ACE and IDA modules. Tests on unseen network scales and real-world network topologies show the superior adaptability of our GSID, compared to the baselines.

cs.NI