On the Complexity of Breaking Pseudoentropy

DOI10.1007/978-3-319-55911-7_43zbMath1370.94544OpenAlexW2583571805MaRDI QIDQ2988853

Maciej Skórski

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_43

zbMATH Keywords

pseudoentropysmooth entropyhardness of Boolean functionsnonuniform attacks

Mathematics Subject Classification ID

Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Cites Work

• Unnamed Item
• Probability inequalities for the sum in sampling without replacement
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
• Metric Pseudoentropy: Characterizations, Transformations and Applications
• Condensed Unpredictability
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• A Leakage-Resilient Mode of Operation
• Information theory and the complexity of boolean functions
• Large deviations for sums of partly dependent random variables
• Memory Delegation
• Probability Inequalities for Sums of Bounded Random Variables
• 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
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: On the Complexity of Breaking Pseudoentropy