Pseudoentropy: lower-bounds for chain rules and transformations

DOI10.1007/978-3-662-53641-4_8zbMATH Open1369.94563OpenAlexW2536534723MaRDI QIDQ3179357FDOQ3179357

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• A Pseudorandom Generator from any One-way Function
• Title not available (Why is that?)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• 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
• 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
• 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 (1)

• 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)