The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free

DOI10.1007/978-3-030-77886-6_14zbMATH Open1479.94298OpenAlexW3096760981MaRDI QIDQ2056741FDOQ2056741

Authors: Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Maciej Skórski, D. Venturi, João L. Ribeiro 

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_14

Recommendations

• Unifying leakage models: from probing attacks to noisy leakage.
• Unifying leakage models: from probing attacks to noisy leakage
• Unifying leakage classes: simulatable leakage and pseudoentropy
• Noisy leakage revisited
• Survey: leakage resilience and the bounded retrieval model

zbMATH Keywords

conditional average min-entropydense leakage model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Efficient public-key cryptography in the presence of key leakage
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
• Title not available (Why is that?)
• Public-key cryptosystems resilient to key leakage
• On cryptography with auxiliary input
• Theory of Cryptography
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Leakage-resilient storage
• Protecting circuits from computationally bounded and noisy leakage
• Leakage-Tolerant Interactive Protocols
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
• Quasi‐random classes of hypergraphs
• Towards sound approaches to counteract power-analysis attacks
• On continual leakage of discrete log representations
• Leakage-resilient non-malleable codes
• Detection of algebraic manipulation in the presence of leakage
• Leakage resilient secret sharing and applications
• Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
• Masking against Side-Channel Attacks: A Formal Security Proof
• Unifying leakage models: from probing attacks to noisy leakage.
• Lower bounds for number-in-hand multiparty communication complexity, made easy
• Indistinguishability obfuscation for Turing machines: constant overhead and amortization
• Unifying leakage models on a Rényi day
• Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
• Unifying leakage models: from probing attacks to noisy leakage
• Noisy leakage revisited
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
• Unifying leakage classes: simulatable leakage and pseudoentropy
• Detecting algebraic manipulation in leaky storage systems
• Automata, Languages and Programming
• On the local leakage resilience of linear secret sharing schemes
• Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.

Cited In (3)

• Unifying leakage classes: simulatable leakage and pseudoentropy
• Impossibility of black-box simulation against leakage attacks
• Improved reductions from noisy to bounded and probing leakages via hockey-stick divergences

This page was built for publication: The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056741)