Non-Asymptotic Analysis of Privacy Amplification via Renyi Entropy and Inf-Spectral Entropy
arXiv:1211.5252
Abstract
This paper investigates the privacy amplification problem, and compares the existing two bounds: the exponential bound derived by one of the authors and the min-entropy bound derived by Renner. It turns out that the exponential bound is better than the min-entropy bound when a security parameter is rather small for a block length, and that the min-entropy bound is better than the exponential bound when a security parameter is rather large for a block length. Furthermore, we present another bound that interpolates the exponential bound and the min-entropy bound by a hybrid use of the Renyi entropy and the inf-spectral entropy.
arXiv comment6 pages, 4 figures
References in corpus (6)
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Leftover Hashing Against Quantum Side Information
- Duality Between Smooth Min- and Max-Entropies
- Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
- Smooth Renyi Entropies and the Quantum Information Spectrum
- Tight exponential analysis of universally composable privacy amplification and its applications