Pseudoentropy: lower-bounds for chain rules and transformations
From MaRDI portal
Publication:3179357
DOI10.1007/978-3-662-53641-4_8zbMATH Open1369.94563OpenAlexW2536534723MaRDI QIDQ3179357FDOQ3179357
Authors: Krzysztof Pietrzak, Maciej Skórski 
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
Recommendations
- The chain rule for HILL pseudoentropy, revisited
- A better chain rule for HILL pseudoentropy -- beyond bounded leakage
- Metric pseudoentropy: characterizations, transformations and applications
- A counterexample to the chain rule for conditional HILL entropy
- A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
Cites Work
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- Computational analogues of entropy
- A Leakage-Resilient Mode of Operation
- Title not available (Why is that?)
- On the Existence of Pseudorandom Generators
- A uniform min-max theorem with applications in cryptography
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- The chain rule for HILL pseudoentropy, revisited
- Some notions of entropy for cryptography. (Invited talk)
- A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
- Memory delegation
- Advances in Cryptology - EUROCRYPT 2004
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- How to fake auxiliary input
- On the Complexity of Hard-Core Set Constructions
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- Theory of Cryptography
- Metric pseudoentropy: characterizations, transformations and applications
- Advice lower bounds for the dense model theorem
Cited In (6)
- A better chain rule for HILL pseudoentropy -- beyond bounded leakage
- On the Complexity of Breaking Pseudoentropy
- Metric pseudoentropy: characterizations, transformations and applications
- A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
- The chain rule for HILL pseudoentropy, revisited
- Modulus computational entropy
This page was built for publication: Pseudoentropy: lower-bounds for chain rules and transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179357)
