The Chain Rule for HILL Pseudoentropy, Revisited
From MaRDI portal
Publication:2946442
DOI10.1007/978-3-319-22174-8_5zbMath1370.94538OpenAlexW1723598079MaRDI QIDQ2946442
Maciej Skórski, Krzysztof Pietrzak
Publication date: 17 September 2015
Published in: Progress in Cryptology -- LATINCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22174-8_5
Related Items (2)
Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage
Cites Work
- Unnamed Item
- A counterexample to the chain rule for conditional HILL entropy
- A Uniform Min-Max Theorem with Applications in Cryptography
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Metric Pseudoentropy: Characterizations, Transformations and Applications
- Some Notions of Entropy for Cryptography
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Condensed Unpredictability
- A Leakage-Resilient Mode of Operation
- A Pseudorandom Generator from any One-way Function
- Overcoming Weak Expectations
- Advances in Cryptology - EUROCRYPT 2004
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- How to Fake Auxiliary Input
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: The Chain Rule for HILL Pseudoentropy, Revisited
