Quasi chain rule for min-entropy
From MaRDI portal
Publication:1707982
DOI10.1016/J.IPL.2018.02.007zbMATH Open1476.94021DBLPjournals/ipl/DziembowskiKZ18OpenAlexW2792451763WikidataQ99673005 ScholiaQ99673005MaRDI QIDQ1707982FDOQ1707982
Authors: Stefan Dziembowski, Tomasz Kazana, Maciej Zdanowicz
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
Recommendations
- Chain Rules for Smooth Min- and Max-Entropies
- Entropy minimization with lattice bounds
- The complexity of estimating min-entropy
- Minimization of entropy functionals
- Maximum entropy derivation of quasi-Newton methods
- Quadratically constrained minimum cross-entropy analysis
- scientific article
- On entropy minimization and convergence
- Minimal Entropy Approximations and Optimal Algorithms
Cites Work
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Randomness is linear in space
- A parallel repetition theorem for leakage resilience
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
Cited In (3)
This page was built for publication: Quasi chain rule for min-entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707982)