Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
From MaRDI portal
Publication:5451071
DOI10.1007/11593447_11zbMath1154.94471OpenAlexW2150154572MaRDI QIDQ5451071
Publication date: 18 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11593447_11
data compressionentropy measuresquantum key agreementrandomness extractionprivacy amplificationinformation reconciliationInformation-theoretic cryptography
Measures of information, entropy (94A17) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62)
Related Items (25)
Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint ⋮ Towards a reverse Newman's theorem in interactive information complexity ⋮ The conditional average entropies ⋮ Information Theoretic Security for Encryption Based on Conditional Rényi Entropies ⋮ Wireless-channel key exchange ⋮ Bounds for smooth min- and max-entropy ⋮ When Are Fuzzy Extractors Possible? ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ One-way functions using algorithmic and classical information theories ⋮ Composable Security in the Bounded-Quantum-Storage Model ⋮ Entropy accumulation ⋮ Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure ⋮ Long term confidentiality: a survey ⋮ On the Complexity of Breaking Pseudoentropy ⋮ Simple and Tight Device-Independent Security Proofs ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes ⋮ Simple one-shot bounds for various source coding problems using smooth Rényi quantities ⋮ Sharp lower bounds on the extractable randomness from non-uniform sources ⋮ A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage ⋮ Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker ⋮ Dimension Reduction for Polynomials over Gaussian Space and Applications ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker ⋮ The Complexity of Differential Privacy ⋮ Mosaics of combinatorial designs for information-theoretic security
This page was built for publication: Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
