Pseudoentropy: lower-bounds for chain rules and transformations

DOI10.1007/978-3-662-53641-4_8MaRDI QIDQ3179357zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Håstad-Impagliazzo-Levin-Luby (HILL) entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60)

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

• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• A Leakage-Resilient Mode of Operation
• A Pseudorandom Generator from any One-way Function
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
• A uniform min-max theorem with applications in cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advice lower bounds for the dense model theorem
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• How to fake auxiliary input
• Memory delegation
• Metric pseudoentropy: characterizations, transformations and applications
• On the Complexity of Hard-Core Set Constructions
• On the Existence of Pseudorandom Generators
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Some notions of entropy for cryptography. (Invited talk)
• The chain rule for HILL pseudoentropy, revisited
• Theory of Cryptography

Cited in

(6)

• A better chain rule for HILL pseudoentropy -- beyond bounded leakage
• A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
• Metric pseudoentropy: characterizations, transformations and applications
• The chain rule for HILL pseudoentropy, revisited
• Modulus computational entropy
• On the Complexity of Breaking Pseudoentropy

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)