A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage

DOI10.1007/978-3-319-49175-2_14zbMath1370.94543OpenAlexW2553916617MaRDI QIDQ2953822

Maciej Skórski

Publication date: 6 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49175-2_14

Mathematics Subject Classification ID

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

Cites Work

• Optimal Amplification of Noisy Leakages
• A Uniform Min-Max Theorem with Applications in Cryptography
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• The Chain Rule for HILL Pseudoentropy, Revisited
• Metric Pseudoentropy: Characterizations, Transformations and Applications
• Modulus Computational Entropy
• Noisy Leakage Revisited
• An Introduction to Randomness Extractors
• Condensed Unpredictability
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• A Leakage-Resilient Mode of Operation
• A Pseudorandom Generator from any One-way Function
• Practical Leakage-Resilient Symmetric Cryptography
• Practical Leakage-Resilient Pseudorandom Objects with Minimum Public Randomness
• Overcoming Weak Expectations
• A Counterexample to the Chain Rule for Conditional HILL Entropy
• Masking against Side-Channel Attacks: A Formal Security Proof
• Memory Delegation
• Key Derivation without Entropy Waste
• Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• How to Fake Auxiliary Input
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage