Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.21819

Legitimate Reconstruction Advantage in Wiretapped Semantics-Aware Remote Monitoring

Bowen Li·Nikolaos Pappas
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper investigates joint accuracy and security in semantics-aware remote monitoring, where source updates intended for a legitimate receiver may also be intercepted by an eavesdropper. We define legitimate reconstruction advantage (LRA) as the joint event that the intended receiver correctly reconstructs the current source state using received updates while the eavesdropper reconstructs it incorrectly. Source evolution changes the relevance of received updates at the two receivers, so their marginal reconstruction accuracies do not, in general, determine the probability of this joint event. Under randomized stationary (RS) transmission and zero-order-hold reconstruction at both receivers, we derive an explicit joint stationary distribution and closed-form expressions for LRA probability and persistence for general finite-state ergodic Markov sources. For two-state and uniform-transition sources, we obtain algebraic expressions that enable low-complexity optimization of RS policies. Analytical and numerical results show that maximizing the probability of legitimate advantage need not maximize its persistence. For two-state sources, rare-transmission analysis reveals that, at a fixed sum of transition probabilities, greater transition asymmetry can increase persistence while reducing LRA probability. Moreover, optimizing marginal accuracy and security metrics can select policies that are suboptimal for LRA. Counterintuitively, more frequent transmission or improved legitimate-channel reliability can increase legitimate reconstruction accuracy while reducing LRA probability. Finally, a geofencing application translates prescribed LRA requirements into spatial constraints on eavesdropper locations.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bowen Li, Nikolaos Pappas. 2026-10-15. Legitimate Reconstruction Advantage in Wiretapped Semantics-Aware Remote Monitoring. https://arxiv.org/abs/2610.21819

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

KEEP EXPLORING

Related papers

arXiv2026

Spectral-Aligned Pruning for Universal Error-Correcting Code Transformers

Universal channel decoders based on transformers-such as the Foundation Error Correction Code Transformer (FECCT)-achieve competitive decoding performance across diverse code families with a single shared backbone, optionally followed by code-specific finetuning. However, the high computational complexity and large parameter footprint of FECCT present substantial obstacles to practical deployment. To address these challenges, we investigate structured pruning for FECCT and propose Spectral-Aligned Pruning (SAP), a structure-aware framework that enables cross-code reuse of structured pruning masks by leveraging the spectrum of the corresponding bipartite graph. SAP is grounded in classical graph analysis of codes: the two algebraically largest adjacency eigenvalues provide compact spectral proxies for degree scale, expansion ratio, and minimum-distance lower bounds. These quantities are directly relevant to decoding performance: degree scale reflects how densely codeword bits and parity checks are connected; expansion ratio influences how information propagates across the bipartite graph; and minimum distance characterizes codeword separation. Based on this connection, SAP uses these two leading eigenvalues as a lightweight code signature for pruning-mask retrieval. Empirically, this two-dimensional signature yields stable library selection equivalent to higher-dimensional spectral signatures in our evaluation. After pruning, SAP uses parameter-efficient low-rank adaptation (LoRA) to recover decoding performance while storing only a small number of additional adapter parameters per code. Experiments across diverse codes show that SAP achieves decoding performance comparable to dedicated per-code pruning, while enabling substantial reductions in computational cost and model memory footprint through kernel-level structured pruning. Code is available at https://github.com/iil-postech/sap.

cs.IT↗
arXiv2026

On the Role of Normalization in Binary Iterative Hard Thresholding for 1-bit Compressed Sensing

Binary Iterative Hard Thresholding (BIHT) is a simple, yet effective, greedy method for recovering a sparse vector from one-bit sign measurements. In its original form, BIHT performs a ``gradient-descent'' step, followed by hard thresholding. A convergence analysis of this algorithm was left open in the introductory work of Jacques, Laska, Boufounos, and Baraniuk [IEEE Trans. Inform. Theory (2013)] and has remained unresolved for over a decade, with subsequent sharp analyses studying a normalized variant instead, that additionally projects every iterate onto the unit sphere. This paper resolves that gap and characterizes when per-iterate normalization is algorithmically necessary. In the noiseless setting, we prove a universal, sample-optimal convergence theorem for the original BIHT algorithm. Specifically, with $\widetilde O(s/ε)$ measurements, a deterministic, computable finite-time iterate has directional error at most $ε$, simultaneously for every $s$-sparse unit vector. This matches the optimal sample dependence achieved by normalized BIHT in prior work. Under sign corruptions, we prove a sharp separation. If at most a $τ$ fraction of signs are flipped adversarially, then BIHT, without per-iterate normalization, still reaches the robust error floor at an early iterate with a matching $\widetilde O(s/ε)$ sample complexity rate as its normalized variant. This recovery, however, is not stable. We prove a scalar lower bound showing that any nontrivial corruption pattern, even one that involves only one flipped sign together with one clean sign, forces the iterates to oscillate indefinitely. Consequently, no general last-iterate convergence theorem can hold for BIHT under sign corruptions, while its normalized surrogate provably escapes this instance.

cs.IT↗
arXiv2026

Collision-Free Schedule Acquisition through Slotted ALOHA: Scaling Laws and Fluctuations

Decentralized networks can learn collision-free periodic transmission schedules, but acquisition can consume much of a finite operating horizon. We characterize acquisition in a reservation protocol for a fixed population of $n$ nodes and a period of $Γ_n\ge n$ slots. Initially, each node attempts independently in each slot with probability proportional to $1/n$. A success reserves a slot that the node reuses every $Γ_n$ slots, retaining it after collisions. Nodes use only their own acknowledgments and small local memory. An exact finite-population Markov reduction, independent of the arrangement of reserved slots, characterizes the time until every node has a distinct reservation. As $n\to\infty$, mean acquisition takes $O(n^2)$ slots when $Γ_n=n$ and $O(n\log n)$ slots when $Γ_n\sim(1+θ)n$, for fixed $θ>0$. With a fixed number $Γ_n-n$ of spare slots, the standard deviation of acquisition time has the same asymptotic order as its mean. If that number diverges while $Γ_n/n$ remains bounded, the ratio of standard deviation to mean tends to zero. A diverging sublinear number of spare slots yields $o(n^2)$ mean acquisition while long-run utilization, the fraction $n/Γ_n$ of slots with successful transmissions, tends to one. Simulations validate these laws and compare acquisition and delivered packets per slot with existing access protocols.

cs.IT↗