Computational analogues of entropy

DOI10.1007/B11961MaRDI QIDQ5900934zbMATH OpenOpenAlexFDO

Authors Boaz Barak, Ronen Shaltiel, A. Wigderson

Publication date 26 May 2010

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

Full work available at URL https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Measures of information, entropy (94A17)

Recommendations

• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Comparing Notions of Computational Entropy
• Comparing notions of computational entropy
• Computational extractors and pseudorandomness
• Some notions of entropy for cryptography. (Invited talk)

Cited in

(39)

• The word entropy and how to compute it
• Predictive models for min-entropy estimation
• One-way functions using algorithmic and classical information theories
• Entropy conservation for comparison-based algorithms
• Incompressible encodings
• Computational fuzzy extractors
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• The complexity of estimating min-entropy
• Entropy and computation: the Landauer-Bennett thesis reexamined
• Advice lower bounds for the dense model theorem
• The chain rule for HILL pseudoentropy, revisited
• Unifying leakage classes: simulatable leakage and pseudoentropy
• Metric pseudoentropy: characterizations, transformations and applications
• Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy
• Overcoming weak expectations via the Rényi entropy and the expanded computational entropy
• Modulus computational entropy
• A better chain rule for HILL pseudoentropy -- beyond bounded leakage
• On the Complexity of Breaking Pseudoentropy
• Some notions of entropy for cryptography. (Invited talk)
• Computational Randomness from Generalized Hardcore Sets
• Pseudoentropy: lower-bounds for chain rules and transformations
• A counterexample to the chain rule for conditional HILL entropy
• Condensed Unpredictability
• A Leakage-Resilient Mode of Operation
• Entropy computing via integration over fractal measures
• Entropy computations via analytic depoissonization
• The many entropies in one-way functions
• The complexity of differential privacy
• Quantified Derandomization: How to Find Water in the Ocean
• Non-uniform attacks against pseudoentropy
• Extracting Computational Entropy and Learning Noisy Linear Functions
• Comparing Notions of Computational Entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Nearly optimal pseudorandomness from hardness
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
• Sharp lower bounds on the extractable randomness from non-uniform sources
• Comparing computational entropies below majority (or: when is the dense model theorem false?)
• Comparing notions of computational entropy

This page was built for publication: Computational analogues of entropy

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