Exponential decreasing rate of leaked information in universal random privacy amplification

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ényi entropy of order 2 because the bound obtained here uses the Rényi entropy of order $1+s$ for $s\in [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.

The organization is a little changed. This version is the same as the published version

References in corpus (1)

• Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's Model

Cited by in corpus (66)

• Rényi generalization of the operational entanglement entropy
• Experimental quantum conference key agreement
• Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages
• Operationally accessible entanglement of one dimensional spinless fermions
• Relating different quantum generalizations of the conditional Renyi entropy
• More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
• Quantum secure direct communication with private dense coding using general preshared quantum state
• Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
• Tight exponential analysis of universally composable privacy amplification and its applications
• Experimental quantum key distribution with simulated ground-to-satellite photon losses and processing limitations
• Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
• Dual universality of hash functions and its applications to quantum cryptography
• Free-space optical channel estimation for physical layer security
• Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information
• Exact Random Coding Secrecy Exponents for the Wiretap Channel
• One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys
• On the Role of Information Theoretic Uncertainty Relations in Quantum Theory
• Numerical Study on Secrecy Capacity and Code Length Dependence of the Performances in Optical Wiretap Channels
• Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
• Attacks on quantum key distribution protocols that employ non-ITS authentication
• Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2
• Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
• Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses
• Key Generation Using External Source Excitation: Capacity, Reliability, and Secrecy Exponent
• Experimental composable security decoy-state quantum key distribution using time-phase encoding
• Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
• Physical Layer Security Protocol for Poisson Channels for Passive Man-in-the-middle Attack
• Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attacker
• Two-Way Physical Layer Security Protocol for Gaussian Channels
• Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes
• Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
• Secure Multiplex Network Coding
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Mosaics of combinatorial designs for information-theoretic security
• The Sender-Excited Secret Key Agreement Model: Capacity, Reliability and Secrecy Exponents
• A tight uniform continuity bound for the Arimoto-Rényi conditional entropy and its extension to classical-quantum states
• Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
• Multiple Private Key Generation for Continuous Memoryless Sources with A Helper
• Information-theoretic Physical Layer Security for Satellite Channels
• Information Theoretic Security for Broadcasting of Two Encrypted Sources under Side-Channel Attacks
• Semantic Security for Quantum Wiretap Channels
• On an almost-universal hash function family with applications to authentication and secrecy codes
• Development of NavIC synchronized fully automated inter-building QKD framework and demonstration of quantum secured video calling
• On the Secrecy Exponent of the Wire-tap Channel
• Secret Sharing Schemes Based on Min-Entropies
• Quantum-inspired secure wireless communication protocol under spatial and local Gaussian noise assumptions
• Secure Computation-and-Forward with Linear Codes
• Finite-Block-Length Analysis in Classical and Quantum Information Theory
• Quantum Keyless Private Communication with Decoy States for Space Channels
• Tight lower bound on the error exponent of classical-quantum channels
• Exact correct-decoding exponent of the wiretap channel decoder
• Secure Multiplex Coding with a Common Message
• Strong Coordination over Noisy Channels
• Iterative minimization algorithm on a mixture family
• Generalizations of Fano's Inequality for Conditional Information Measures via Majorization Theory
• Rényi Bounds on Information Combining
• On a Relationship between the Correct Probability of Estimation from Correlated Data and Mutual Information
• Physical layer insecurity
• Sharp Bounds on Arimoto's Conditional Rényi Entropies Between Two Distinct Orders
• Non-Adaptive Coding for Two-Way Wiretap Channel with or without Cost Constraints
• Rényi divergence-based uniformity guarantees for $k$-universal hash functions
• Measuring quantum relative entropy with finite-size effect
• When quantum memory is useful for dense coding
• Optimum ratio between two bases in Bennett-Brassard 1984 protocol with second order analysis
• Expurgation Exponent of Leaked Information in Privacy Amplification for Binary Sources