Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy

DOI10.1007/978-3-319-17470-9_5zbMath1343.94049OpenAlexW2250744952MaRDI QIDQ2947523

Benjamin Fuller, Ariel Hamlin

Publication date: 24 September 2015

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-17470-9_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Efficient leakage-resilient MACs without idealized assumptions ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free ⋮ Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle

Cites Work

• Unnamed Item
• Randomness is linear in space
• Efficient cache attacks on AES, and countermeasures
• Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions
• RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis
• Simulatable Leakage: Analysis, Pitfalls, and New Constructions
• Modulus Computational Entropy
• Some Notions of Entropy for Cryptography
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Signature Schemes with Bounded Leakage Resilience
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A Pseudorandom Generator from any One-way Function
• A Counterexample to the Chain Rule for Conditional HILL Entropy
• Signature Schemes Secure against Hard-to-Invert Leakage
• Towards sound approaches to counteract power-analysis attacks
• On cryptography with auxiliary input
• Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Advances in Cryptology - CRYPTO 2003
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Topics in Cryptology – CT-RSA 2006
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Theory of Cryptography

This page was built for publication: Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy