Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications
From MaRDI portal
Abstract: Motivated by the desirability of universal composability, we analyze in terms of L_1 distinguishability the task of secret key generation from a joint random variable. Under this secrecy criterion, using the Renyi entropy of order 1+s for s in [0,1, we derive a new upper bound of Eve's distinguishability under the application of the universal2 hash functions. It is also shown that this bound gives the tight exponential rate of decrease in the case of independent and identical distributions. The result is applied to the wire-tap channel model and to secret key generation (distillation) by public discussion.
Cited in
(9)- Position-based coding and convex splitting for private communication over quantum channels
- A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
- Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- Relating different quantum generalizations of the conditional Rényi entropy
- Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
- Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
- Semantic security for quantum wiretap channels
- Adaptive coding for two-way wiretap channel under strong secrecy
This page was built for publication: Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346278)
