Key derivation without entropy waste

DOI10.1007/978-3-642-55220-5_6MaRDI QIDQ5418691zbMATH OpenOpenAlexFDO

Authors Yevgeniy Dodis, Krzysztof Pietrzak, Daniel Wichs

Publication date 27 May 2014

Published in Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-55220-5_6

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Information theory (general) (94A15) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 6862149
• Leftover Hash Lemma, Revisited
• Randomness condensers for efficiently samplable, seed-dependent sources
• Condensed Unpredictability
• Cryptographic extraction and key derivation: the HKDF scheme

Cited in

(10)

• Random oracles and non-uniformity
• Reusable fuzzy extractors for low-entropy distributions
• Challenge codes for physically unclonable functions with Gaussian delays: a maximum entropy problem
• Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
• Randomness condensers for efficiently samplable, seed-dependent sources
• A framework for security analysis of key derivation functions
• A better chain rule for HILL pseudoentropy -- beyond bounded leakage
• Condensed Unpredictability
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
• Almost Chor-Goldreich sources and adversarial random walks

This page was built for publication: Key derivation without entropy waste

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418691)