Efficient Leakage Resilient Circuit Compilers
From MaRDI portal
Publication:2790050
DOI10.1007/978-3-319-16715-2_17zbMath1382.94047OpenAlexW316831625MaRDI QIDQ2790050
Antigoni Polychroniadou, Sebastian Faust, Marcin Andrychowicz, Stefan Dziembowski, Ivan B. Damgård
Publication date: 2 March 2016
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-16715-2_17
Cites Work
- Fast multiplication of polynomials over fields of characteristic 2
- High-order Masking by Using Coding Theory and Its Application to AES
- RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis
- Leakage-Tolerant Computation with Input-Independent Preprocessing
- Leakage-Resilient Circuits without Computational Assumptions
- How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
- How to share a secret
- Leakage-Resilient Cryptography from the Inner-Product Extractor
- Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Protecting Cryptographic Keys against Continual Leakage
- Securing Computation against Continuous Leakage
- Provably Secure Higher-Order Masking of AES
- Leakage-Resilient Storage
- Masking against Side-Channel Attacks: A Formal Security Proof
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
This page was built for publication: Efficient Leakage Resilient Circuit Compilers
