Second-Order Expansion of Privacy Amplification Under f-Divergence Criteria
Characterize the second-order asymptotics of randomness extraction (privacy amplification) from memoryless sources with side information, under security criteria given by a broad class of Csiszár f-divergences. Two settings are treated: a fixed reference side-information marginal and a reference marginal optimized over.
One-shot converse and achievability bounds reduce the leakage to a capped f-divergence perspective cost. This cost is solved by a conditional water-filling optimizer that is universal over the admissible generators. Berry–Esseen-based conditional Gaussian limits then evaluate the bounds, with two-universal hashing used for achievability. All numbered results and definitions are formalized in Lean 4 with Mathlib.
With a fixed marginal, the limit is a Gaussian-mixture profile that depends separately on the conditional entropy fluctuation V1 and the average conditional variance V2. With an optimized marginal, these combine into a single Gaussian profile in the total varentropy V. Corollaries give second-order expansions for Rényi criteria of all orders α∈(0,1) and recover the known total-variation expansion.
