Pseudoentropy: Lower-Bounds for Chain Rules and Transformations
From MaRDI portal
Publication:3179357
DOI10.1007/978-3-662-53641-4_8zbMath1369.94563OpenAlexW2536534723MaRDI QIDQ3179357
Maciej Skórski, Krzysztof Pietrzak
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_8
Cites Work
- Unnamed Item
- Unnamed Item
- Advice Lower Bounds for the Dense Model Theorem
- 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
- The Chain Rule for HILL Pseudoentropy, Revisited
- Metric Pseudoentropy: Characterizations, Transformations and Applications
- Some Notions of Entropy for Cryptography
- A Leakage-Resilient Mode of Operation
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- A Pseudorandom Generator from any One-way Function
- On the Existence of Pseudorandom Generators
- A Counterexample to the Chain Rule for Conditional HILL Entropy
- Memory Delegation
- Advances in Cryptology - EUROCRYPT 2004
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On the Complexity of Hard-Core Set Constructions
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- How to Fake Auxiliary Input
- Theory of Cryptography
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Pseudoentropy: Lower-Bounds for Chain Rules and Transformations
