A counterexample to the chain rule for conditional HILL entropy (Q332268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6645061 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational entropy
Property / zbMATH Keywords: computational entropy / rank
 
Normal rank
Property / zbMATH Keywords
 
HILL entropy
Property / zbMATH Keywords: HILL entropy / rank
 
Normal rank
Property / zbMATH Keywords
 
chain rule
Property / zbMATH Keywords: chain rule / rank
 
Normal rank
Property / zbMATH Keywords
 
lossy functions
Property / zbMATH Keywords: lossy functions / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00037-015-0120-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1566212649 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124851850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and Upper Bounds for Deniable Public-Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory Delegation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deniable Encryption with Negligible Detection Probability: An Interactive Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating succinct non-interactive arguments from all falsifiable assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key agreement from weak bit agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Fake Auxiliary Input / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Counterexample to the Chain Rule for Conditional HILL Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy trapdoor functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Notions of Entropy for Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use indistinguishability obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modulus Computational Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing pseudoentropy and simplifying pseudorandom generator constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Min-Max Theorem with Applications in Cryptography / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:34, 12 July 2024

scientific article
Language Label Description Also known as
English
A counterexample to the chain rule for conditional HILL entropy
scientific article

    Statements

    A counterexample to the chain rule for conditional HILL entropy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 October 2016
    0 references
    computational entropy
    0 references
    HILL entropy
    0 references
    chain rule
    0 references
    lossy functions
    0 references
    0 references
    0 references
    0 references

    Identifiers