Quasi chain rule for min-entropy

DOI10.1016/j.ipl.2018.02.007zbMath1476.94021DBLPjournals/ipl/DziembowskiKZ18OpenAlexW2792451763WikidataQ99673005 ScholiaQ99673005MaRDI QIDQ1707982

Tomasz Kazana, Maciej Zdanowicz, Stefan Dziembowski

Publication date: 4 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.007

zbMATH Keywords

cryptographyinformation theorymin-entropychain-rule

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (1)

Speak much, remember little: cryptography in the bounded storage model, revisited

Cites Work

• Randomness is linear in space
• A Parallel Repetition Theorem for Leakage Resilience
• 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
• Simulating independence

This page was built for publication: Quasi chain rule for min-entropy