A counterexample to the chain rule for conditional HILL entropy

DOI10.1007/S00037-015-0120-9MaRDI QIDQ332268zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

chain rulecomputational entropyHILL entropylossy functions

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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

Cites work

• scientific article; zbMATH DE number 1306886 (Why is no real title available?)
• scientific article; zbMATH DE number 1088228 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
• A uniform min-max theorem with applications in cryptography
• Bit commitment using pseudorandomness
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Computational Complexity
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Deniable encryption with negligible detection probability: an interactive construction
• Foundations of Cryptography
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• How to fake auxiliary input
• How to use indistinguishability obfuscation
• Key agreement from weak bit agreement
• Lossy trapdoor functions and their applications
• Lower and upper bounds for deniable public-key encryption
• Memory delegation
• Modulus computational entropy
• NP is as easy as detecting unique solutions
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Some notions of entropy for cryptography. (Invited talk)

Cited in

(8)

• A better chain rule for HILL pseudoentropy -- beyond bounded leakage
• Counterexamples to the product rule for entropy
• Pseudoentropy: lower-bounds for chain rules and transformations
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• The Chaining Lemma and its application
• The chain rule for HILL pseudoentropy, revisited
• Modulus computational entropy
• A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it

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)