Sonia Belaïd

Orcid: 0000-0002-9437-6425

According to our database1, Sonia Belaïd authored at least 38 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Masked Circuit Compiler in the Cardinal Random Probing Composability Framework.
IACR Cryptol. ePrint Arch., 2025

PERSEUS - Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling.
IACR Cryptol. ePrint Arch., 2025

Further Improvements in AES Execution over TFHE: Towards Breaking the 1 sec Barrier.
IACR Cryptol. ePrint Arch., 2025

SoK: A Methodology to Achieve Provable Side-Channel Security in Real-World Implementations.
IACR Commun. Cryptol., 2025

Further Improvements in AES Execution over TFHE.
IACR Commun. Cryptol., 2025

New Techniques for Random Probing Security and Application to Raccoon Signature Scheme.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Transistor: a TFHE-Friendly Stream Cipher.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Formal Definition and Verification for Combined Random Fault and Random Probing Security.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
High Order Side-Channel Security for Elliptic-Curve Implementations.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Towards Achieving Provable Side-Channel Security in Practice.
IACR Cryptol. ePrint Arch., 2023

Unifying Freedom and Separation for Tight Probing-Secure Composition.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
IronMask: Versatile Verification of Masking Security.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021
High Order Countermeasures for Elliptic-Curve Implementations with Noisy Leakage Security.
IACR Cryptol. ePrint Arch., 2021

On the Power of Expansion: More Efficient Constructions in the Random Probing Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Dynamic Random Probing Expansion with Quasi Linear Asymptotic Complexity.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Improved parallel mask refreshing algorithms: generic solutions with parametrized non-interference and automated optimizations.
J. Cryptogr. Eng., 2020

Tornado: Automatic Generation of Probing-Secure Masked Bitsliced Implementations.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Random Probing Security: Verification, Composition, Expansion and New Constructions.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
maskVerif: Automated Verification of Higher-Order Masking in Presence of Physical Defaults.
Proceedings of the Computer Security - ESORICS 2019, 2019

GALACTICS: Gaussian Sampling for Lattice-Based Constant- Time Implementation of Cryptographic Signatures, Revisited.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
maskVerif: a formal tool for analyzing software and hardware masked implementations.
IACR Cryptol. ePrint Arch., 2018

Improved Parallel Mask Refreshing Algorithms: Generic Solutions with Parametrized Non-Interference & Automated Optimizations.
IACR Cryptol. ePrint Arch., 2018

Masking the GLP Lattice-Based Signature Scheme at Any Order.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Tight Private Circuits: Achieving Probing Security with the Least Refreshing.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Private Multiplication over Finite Fields.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Randomness Complexity of Private Circuits for Multiplication.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Strong Non-Interference and Type-Directed Higher-Order Masking.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Security of Cryptosystems Against Power-Analysis Attacks. (Sécurité des cryptosystèmes contre les attaques par analyse de courant).
PhD thesis, 2015

Compositional Verification of Higher-Order Masking: Application to a Verifying Masking Compiler.
IACR Cryptol. ePrint Arch., 2015

Verified Proofs of Higher-Order Masking.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Improved Side-Channel Analysis of Finite-Field Multiplication.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2015, 2015

Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
Towards fresh re-keying with leakage-resilient PRFs: cipher design principles and analysis.
J. Cryptogr. Eng., 2014

Masking and Leakage-Resilient Primitives: One, the Other(s) or Both?
IACR Cryptol. ePrint Arch., 2014

Differential Power Analysis of HMAC SHA-1 and HMAC SHA-2 in the Hamming Weight Model.
Proceedings of the E-Business and Telecommunications - 11th International Joint Conference, 2014

Side-Channel Analysis of Multiplications in GF(2128) - Application to AES-GCM.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Differential Power Analysis of HMAC SHA-2 in the Hamming Weight Model.
Proceedings of the SECRYPT 2013, 2013

Leakage-Resilient Symmetric Encryption via Re-keying.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2013, 2013


  Loading...