A counterexample to the chain rule for conditional HILL entropy
DOI10.1007/S00037-015-0120-9zbMATH Open1369.94550OpenAlexW1566212649WikidataQ124851850 ScholiaQ124851850MaRDI QIDQ332268FDOQ332268
Authors: Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia, Daniel Wichs 
Publication date: 28 October 2016
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-015-0120-9
Recommendations
- A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
- Counterexamples to the product rule for entropy
- A formula of conditional entropy and some applications
- On the Conditional Rényi Entropy
- Constant conditional entropy and related hypotheses
- Chain Rules for Smooth Min- and Max-Entropies
- The chain rule for HILL pseudoentropy, revisited
- Counterexample to the Vector Generalization of Costa’s Entropy Power Inequality, and Partial Resolution
- Further results on generalized conditional entropies
Measures of information, entropy (94A17) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- A Pseudorandom Generator from any One-way Function
- Bit commitment using pseudorandomness
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Foundations of Cryptography
- Computational Complexity
- Computational analogues of entropy
- NP is as easy as detecting unique solutions
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- A Uniform Min-Max Theorem with Applications in Cryptography
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Modulus Computational Entropy
- Some notions of entropy for cryptography. (Invited talk)
- Deniable encryption with negligible detection probability: an interactive construction
- Lower and upper bounds for deniable public-key encryption
- Lossy trapdoor functions and their applications
- Key agreement from weak bit agreement
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Counterexample to the Chain Rule for Conditional HILL Entropy
- Memory delegation
- How to use indistinguishability obfuscation
- 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
- How to Fake Auxiliary Input
Cited In (3)
This page was built for publication: A counterexample to the chain rule for conditional HILL entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q332268)
