Search arXivSearch

arXiv · 2602.09029

Fixed-Composition Shuffle Asymptotics in the Full-Support Gaussian Regime

Abstract

We study privacy amplification by shuffling for binary-input local randomizers with a fixed finite output alphabet and full support. For a dataset containing exactly k ones among n users, let T_{n,k} denote the shuffled histogram law. For fixed-composition neighboring shuffled histogram laws in the interior regime, we identify the covariance and Fisher constant governing the neighboring pair (T_{n,k},T_{n,k+1}). For a composition parameter pi in [0,1], the correct covariance is Sigma_pi=(1-pi)Sigma_0+pi Sigma_1 rather than the multinomial covariance of the mixture. With v=W_1-W_0, the resulting constant is I_pi=v^T Sigma_pi^+ v. We prove exact likelihood-ratio identities and a regression decomposition with residual moments E[R^2]=O(n^{-2}) and E[R^4]=O(n^{-4}), uniformly over interior compositions. Consequently, JSD(T_{n,k}||T_{n,k+1})=I_{k/n}/(8n)+O(n^{-2}), and the same constant governs smooth divergence asymptotics. For mu_n=(I_{k/n}/n)^{1/2}, both directed hockey-stick privacy curves at epsilon=t mu_n equal mu_n{phi(t)-t Phi(-t)}+O(n^{-1}) uniformly for t in compact sets. Exact finite-n accounting formulas and fixed-message unbundled specializations are also provided.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alex Shvets. 2026-07-11. Fixed-Composition Shuffle Asymptotics in the Full-Support Gaussian Regime. https://arxiv.org/abs/2602.09029

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

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT