On the Complexity of Breaking Pseudoentropy

DOI10.1007/978-3-319-55911-7_43MaRDI QIDQ2988853zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Complexity measurement of fundamental pseudo-independent models
• Pseudoentropy: lower-bounds for chain rules and transformations
• The complexity of pseudo-linear functions
• The Complexity of Approximating the Entropy
• Non-uniform attacks against pseudoentropy
• A note on the complexity function and entropy of pseudogroups
• Complexity of Ehrenfeucht models
• On the \(p\)-reinforcement and the complexity
• Pseudolinearity and efficiency
• On Simplex Pivoting Rules and Complexity Theory

Cites work

• scientific article; zbMATH DE number 5081837 (Why is no real title available?)
• A Leakage-Resilient Mode of Operation
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Computational analogues of entropy
• Condensed Unpredictability
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Information theory and the complexity of boolean functions
• Large deviations for sums of partly dependent random variables
• Memory delegation
• Metric pseudoentropy: characterizations, transformations and applications
• Probability Inequalities for Sums of Bounded Random Variables
• Probability inequalities for the sum in sampling without replacement
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Time space tradeoffs for attacks against one-way functions and PRGs

Cited in

(2)

• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Non-uniform attacks against pseudoentropy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988853)