Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
From MaRDI portal
Publication:5429389
DOI10.1007/978-3-540-72540-4_10zbMath1141.94357OpenAlexW2154034877MaRDI QIDQ5429389
Leonid Reyzin, Chun-Yuan Hsiao, Chi-Jen Lu
Publication date: 29 November 2007
Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_10
Related Items (24)
Condensed Unpredictability ⋮ Witness authenticating NIZKs and applications ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ The Chain Rule for HILL Pseudoentropy, Revisited ⋮ Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy ⋮ Metric Pseudoentropy: Characterizations, Transformations and Applications ⋮ Gambling, Computational Information and Encryption Security ⋮ Modulus Computational Entropy ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ Computational fuzzy extractor from LWE ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ One-way functions using algorithmic and classical information theories ⋮ Computational fuzzy extractors ⋮ On the Complexity of Breaking Pseudoentropy ⋮ Reusable fuzzy extractors for low-entropy distributions ⋮ Pseudorandom generators from regular one-way functions: new constructions with improved parameters ⋮ Comparing notions of computational entropy ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Computational Randomness from Generalized Hardcore Sets ⋮ Incompressible encodings ⋮ The Many Entropies in One-Way Functions
This page was built for publication: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
