Pages that link to "Item:Q5429389"

The following pages link to Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility (Q5429389):

Displaying 26 items.

• A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
• Comparing notions of computational entropy (Q733747) (← links)
• One-way functions using algorithmic and classical information theories (Q1946513) (← links)
• Reusable fuzzy extractors for low-entropy distributions (Q2032056) (← links)
• Incompressible encodings (Q2096497) (← links)
• Witness authenticating NIZKs and applications (Q2139626) (← links)
• Computational fuzzy extractors (Q2216116) (← links)
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
• Computational fuzzy extractor from LWE (Q2682915) (← links)
• The Chain Rule for HILL Pseudoentropy, Revisited (Q2946442) (← links)
• Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy (Q2947523) (← links)
• Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
• Gambling, Computational Information and Encryption Security (Q2947527) (← links)
• Modulus Computational Entropy (Q2948262) (← links)
• A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage (Q2953822) (← links)
• On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
• Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
• Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
• Condensed Unpredictability (Q3448859) (← links)
• The Many Entropies in One-Way Functions (Q5021132) (← links)
• Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
• Upgrading fuzzy extractors (Q6547977) (← links)
• Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus (Q6595688) (← links)