Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.15972

Exact Privacy--Distortion Design of Support-Constrained Randomized Response

Amirreza Zamani·Parastoo Sadeghi·Mikael Skoglund
View original source ↗Read source document ↗Export metadata ↓

Abstract

Full-support local randomizers can incur unnecessary reporting distortion on ordered alphabets. We study randomized response whose output is restricted to a radius-$t$ neighborhood of the private input. Input-dependent supports create privacy leakage at their boundaries, so ordinary likelihood-ratio calibration is no longer sufficient. Under approximate local privacy restricted to input pairs at distance at most $H$, we derive the exact hockey-stick defect of the mechanism. We then solve the joint design of the truthful probability, off-truth probability, and support radius. The fixed-radius optimum is available in closed form, while the global optimum requires only a one-dimensional integer search. We characterize both the privacy floor and its inverse, namely the smallest defect attainable under a reporting-distortion budget. We further prove that stringent approximate privacy forces the support size to scale as $Ω(H/δ)$. Deterministic evaluations illustrate the resulting tradeoff.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund. 2026-10-11. Exact Privacy--Distortion Design of Support-Constrained Randomized Response. https://arxiv.org/abs/2610.15972

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

KEEP EXPLORING

Related papers

arXiv2026

Quasi-twisted codes and their connection with additive constacyclic codes over finite fields

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to quasi-cyclic codes and determine Euclidean, Hermitian, and symplectic duals of quasi-twisted codes with index $2$. Additionally, we provide necessary and sufficient conditions for the self-orthogonality of appropriate quasi-twisted codes. Next, we explore a one-to-one correspondence between quasi-twisted codes of length $lm$ with index $l$ over $\mathbb{F}_q$ and additive constacyclic codes of length $m$ over $\mathbb{F}_{q^l}$. We establish relationships between trace inner products in the additive setting and Euclidean, symplectic inner products in the quasi-twisted setting. Using these relations and the correspondence, we determine the dual of additive constacyclic codes with respect to the trace inner products. As a consequence, we conclude that determining the trace Euclidean dual and trace Hermitian dual of an additive constacyclic code is equivalent to determining the Euclidean and symplectic dual of the corresponding quasi-twisted code.

cs.IT↗
arXiv2026

Performance Analysis of Pinching Antenna Systems Enabled NOMA Communications

Pinching antenna systems (PASS) have the advantages in the perspective of flexible antenna reconfiguration, line-of-sight (LoS) creation, and scalability features. To highlight the ascendancy of PASS, we survey the integration of PASS into non-orthogonal multiple access (NOMA) networks. The locations of nodes are randomly distributed within a circular coverage region. The influencing factors of line-of-sight (LoS) and non-line-of-sight (NLoS) propagation links from PASS to non-orthogonal nodes are taken into considered. To characterize performance of PASS-NOMA, we deduce the blockage probability and ergodic data rates expressions of two nodes over LoS/NLoS fading channels. In light of these theoretical results, the infinite diversity gain are also analyzed with near node n under non-ideal successive interference cancellation (NISIC) and far node f over LoS links. The slopes of ergodic data rate for node n with NISIC and node f were equal to zeros. In addition, the PASS-NOMA system throughput are evaluated in different transmission modes. It is shown from the numerical results that: 1) The blockage outage behaviors of PASS-NOMA networks with LoS/NLoS conditions outperform that of PASS aided traditional orthogonal multiple access (OMA); 2)The employment of PASS enables the larger ergodic data rates relative to PASS-OMA networks; and 3) As the quantity of pinching antennas rises, the performance of PASS-NOMA networks are enhanced over LoS/NLoS propagation links.

cs.IT↗
arXiv2026

Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem

Approximate message passing (AMP) provides fast iterative algorithms for high-dimensional signal recovery with Gaussian design matrices, while the Convex Gaussian Min--max Theorem (CGMT) gives a static optimization framework for obtaining sharp asymptotic characterizations of convex estimators. Although these two frameworks often lead to the same scalar state-evolution equations, their connection is usually indirect. In this paper, we establish a direct connection between the two for regularized linear regression in the proportional high-dimensional regime. When the CGMT Auxiliary Optimization (AO) and Primary Optimization (PO) give the same primal-dual solution, we show that the CGMT framework recovers the AMP fixed-point equations, including the Onsager correction. We further identify the AO Gaussian vectors with the Gaussian perturbations in the primal and residual AMP channels. For regularized $M$-estimation, the same viewpoint recovers the fixed point of scalar-variance max-sum Generalized AMP (GAMP). These results show that the AMP (and GAMP) fixed-point equations can be recovered from the CGMT framework and may suggest AMP-like algorithms in settings where standard derivations are unavailable.

cs.IT↗