On the Complexity of Breaking Pseudoentropy

DOI10.1007/978-3-319-55911-7_43zbMATH Open1370.94544OpenAlexW2583571805MaRDI QIDQ2988853FDOQ2988853

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

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

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)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Computational analogues of entropy
• A Leakage-Resilient Mode of Operation
• Title not available (Why is that?)
• Large deviations for sums of partly dependent random variables
• Probability inequalities for the sum in sampling without replacement
• Memory delegation
• 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
• Information theory and the complexity of boolean functions
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Time space tradeoffs for attacks against one-way functions and PRGs
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• Metric pseudoentropy: characterizations, transformations and applications
• Condensed Unpredictability

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)