A counterexample to the chain rule for conditional HILL entropy
From MaRDI portal
Publication:332268
DOI10.1007/s00037-015-0120-9zbMath1369.94550OpenAlexW1566212649WikidataQ124851850 ScholiaQ124851850MaRDI QIDQ332268
Daniel Wichs, Krzysztof Pietrzak, Akshay Wadia, Stephan Krenn
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
Cryptography (94A60) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- NP is as easy as detecting unique solutions
- 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
- Deniable Encryption with Negligible Detection Probability: An Interactive Construction
- Lower and Upper Bounds for Deniable Public-Key Encryption
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Lossy trapdoor functions and their applications
- Key agreement from weak bit agreement
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- 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
- Computational Complexity
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: A counterexample to the chain rule for conditional HILL entropy
