Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
DOI10.1007/11593447_11zbMATH Open1154.94471OpenAlexW2150154572MaRDI QIDQ5451071FDOQ5451071
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
Recommendations
data compressionquantum key agreemententropy measuresrandomness extractionprivacy amplificationinformation reconciliationInformation-theoretic cryptography
Information theory (general) (94A15) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)
Cited In (33)
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- The conditional average entropies
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- Theory of Cryptography
- Composable Security in the Bounded-Quantum-Storage Model
- Bounds for smooth min- and max-entropy
- Entropy accumulation
- Impossibility of efficient information-theoretic fuzzy extraction
- Long term confidentiality: a survey
- Dimension Reduction for Polynomials over Gaussian Space and Applications
- Mosaics of combinatorial designs for information-theoretic security
- Simple one-shot bounds for various source coding problems using smooth Rényi quantities
- The Complexity of Differential Privacy
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- The effect of side-information on smooth entropy.
- Sharp lower bounds on the extractable randomness from non-uniform sources
- Simple and Tight Device-Independent Security Proofs
- Simplifying information-theoretic arguments by post-selection
- Placing conditional disclosure of secrets in the communication complexity universe
- Wireless-channel key exchange
- Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure
- A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
- When Are Fuzzy Extractors Possible?
- Towards a reverse Newman's theorem in interactive information complexity
- On the Complexity of Breaking Pseudoentropy
- Non-local computation and the black hole interior
- Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker
- One-way functions using algorithmic and classical information theories
- Information theories with adversaries, intrinsic information, and entanglement
- Linking information reconciliation and privacy amplification
This page was built for publication: Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451071)
