Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification

DOI10.1109/TIT.2011.2110950MaRDI QIDQ5273652zbMATH OpenFDO

Authors Masahito Hayashi

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0904.0308

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62)

Abstract: We derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett et al(1995)'s bound based on the R'enyi entropy of order 2 because the bound obtained here uses the R'enyi entropy of order $1+s$ for $sin[0,1]$. This bound is applied to a wire-tap channel. Then, we derive an exponential upper bound for Eve's information. Our exponent is compared with Hayashi(2006)'s exponent. For the additive case, the bound obtained here is better. The result is applied to secret key agreement by public discussion.

Recommendations

• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications
• Quantifying information leakage of randomized protocols
• Quantifying information leakage of randomized protocols
• Asymptotic information leakage under one-try attacks
• Asymptotic information leakage under one-try attacks
• Privacy amplification with asymptotically optimal entropy loss
• Privacy amplification with asymptotically optimal entropy loss

Cited in

(21)

• Mosaics of combinatorial designs for information-theoretic security
• 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
• Attacks on quantum key distribution protocols that employ non-ITS authentication
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
• Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
• Role of information theoretic uncertainty relations in quantum theory
• Relating different quantum generalizations of the conditional Rényi entropy
• Quantum security analysis via smoothing of Renyi entropy of order 2
• On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
• Universal Covertness for Discrete Memoryless Sources
• Simulation of a random variable and its application to game theory
• Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
• Common Information, Noise Stability, and Their Extensions
• Semantic security for quantum wiretap channels
• When quantum memory is useful for dense coding
• Adaptive coding for two-way wiretap channel under strong secrecy
• A toolbox for refined information-theoretic analyses
• Iterative minimization algorithm on a mixture family
• Quantum conditional entropies from convex trace functionals

This page was built for publication: Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273652)