Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility

DOI10.1007/978-3-540-72540-4_10MaRDI QIDQ5429389zbMATH OpenOpenAlexFDO

Authors Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• Computational analogues of entropy
• Comparing Notions of Computational Entropy
• Comparing notions of computational entropy
• A counterexample to the chain rule for conditional HILL entropy
• On the Complexity of Breaking Pseudoentropy

Cited in

(45)

• One-way functions using algorithmic and classical information theories
• Entropy compression versus Lovász local lemma
• Reusable fuzzy extractors for low-entropy distributions
• Incompressible encodings
• Witness authenticating NIZKs and applications
• Computational fuzzy extractors
• Unifying computational entropies via Kullback-Leibler divergence
• 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
• Computational fuzzy extractor from LWE
• 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
• Gambling, computational information and encryption security
• 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
• The many entropies in one-way functions
• Non-uniform attacks against pseudoentropy
• An incremental approach to computing conditional complementary entropy for dynamic information systems with varying object set
• Extracting Computational Entropy and Learning Noisy Linear Functions
• Comparing Notions of Computational Entropy
• Computational analogues of entropy
• Lockable obfuscation from circularly insecure fully homomorphic encryption
• Instantiability of classical random-oracle-model encryption transforms
• Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
• Upgrading fuzzy extractors
• Nearly optimal pseudorandomness from hardness
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• A generic approach to adaptively-secure broadcast encryption in the plain model
• Monotone-policy BARGs and more from BARGs and quadratic residuosity
• Hide-and-seek and the non-resignability of the BUFF transform
• BUFFing FALCON without increasing the signature size
• On the scaled Rényi entropy and application
• Comparing computational entropies below majority (or: when is the dense model theorem false?)
• Generalized and unified equivalences between hardness and pseudoentropy
• On the impossibility of actively secure distributed samplers
• Comparing notions of computational entropy

This page was built for publication: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility

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