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

Information theory (general) (94A15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) 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

(17)

• Simulation of a random variable and its application to game theory
• On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
• Attacks on quantum key distribution protocols that employ non-ITS authentication
• Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
• When quantum memory is useful for dense coding
• Mosaics of combinatorial designs for information-theoretic security
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• Relating different quantum generalizations of the conditional Rényi entropy
• Role of information theoretic uncertainty relations in quantum theory
• Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• Semantic security for quantum wiretap channels
• Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker
• Common Information, Noise Stability, and Their Extensions
• Quantum security analysis via smoothing of Renyi entropy of order 2
• Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
• Universal Covertness for Discrete Memoryless Sources

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)