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

DOI10.1007/978-3-030-77886-6_14MaRDI QIDQ2056741zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

conditional average min-entropydense leakage model

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(3)

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

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)