Condensed Unpredictability

DOI10.1007/978-3-662-47672-7_85zbMath1447.94013arXiv1504.07621OpenAlexW3037333909MaRDI QIDQ3448859

Alexander Golovnev, Maciej Skórski, Krzysztof Pietrzak

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07621

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (3)

The Chain Rule for HILL Pseudoentropy, Revisited ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ On the Complexity of Breaking Pseudoentropy

Cites Work

• Unnamed Item
• Cryptographic Extraction and Key Derivation: The HKDF Scheme
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• A Pseudorandom Generator from any One-way Function
• Overcoming Weak Expectations
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• Memory Delegation
• More deterministic simulation in logspace
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Secure Remote Authentication Using Biometric Data
• Key Derivation without Entropy Waste
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Condensed Unpredictability