Search

Your search keyword '"Standaert, François-Xavier"' showing total 27 results
Start Over Author "Standaert, François-Xavier" Publisher springer science and business media llc
27 results on '"Standaert, François-Xavier"'

2. Reducing risks through simplicity: high side-channel security for lazy engineers

Author

UCL - SST/ICTM/ELEN - Pôle en ingénierie électrique, Bronchain, Olivier, Schneider, Tobias, Standaert, François-Xavier, UCL - SST/ICTM/ELEN - Pôle en ingénierie électrique, Bronchain, Olivier, Schneider, Tobias, and Standaert, François-Xavier

Abstract

Countermeasures against side-channel attacks are in general expensive, and a lot of research has been devoted to the optimization of their security versus performance trade-off. Besides, a wide literature has also shown that implementing such countermeasures is an error-prone task and requires to deal with various engineering challenges (e.g., physical defaults, compositional errors,..). This work aims to contribute to this second item, by evaluating the extent to which (almost) key-homomorphic primitives, and in particular a recent PRF instance based on the learning with rounding problem, can lead to easy-to-implement and easier-to-evaluate side-channel-secure designs. We confirm these properties by describing an FPGA implementation that does not require complex (compositional) reasoning in its analysis and can be masked securely under simple design conditions, and for which the evaluation directly scales to arbitrary number of shares. We provide a comprehensive performance and (worst-case) security analysis of our design and compare the obtained results with those of an AES implementation protected with the domain-oriented masking scheme. Results show that simplicity has a cost, which becomes less prohibitive as security requirements increase.

Published
2021

3. How to fool a black box machine learning based side-channel security evaluation

Author

UCL - SST/ICTM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Bertrand Van Ouytsel, Charles-Henry, Bronchain, Olivier, Cassiers, Gaëtan, Standaert, François-Xavier, UCL - SST/ICTM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Bertrand Van Ouytsel, Charles-Henry, Bronchain, Olivier, Cassiers, Gaëtan, and Standaert, François-Xavier

Abstract

Machine learning and deep learning algorithms are increasingly considered as potential candidates to perform black box side-channel security evaluations. Inspired by the literature on machine learning security, we put forward that it is easy to conceive implementations for which such black box security evaluations will incorrectly conclude that recovering the key is difficult, while an informed evaluator / adversary will reach the opposite conclusion (i.e., that the device is insecure given the amount of measurements available).

Published
2021

9. Improved parallel mask refreshing algorithms: generic solutions with parametrized non-interference and automated optimizations

Author

UCL - SST/ICTM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Barthe, Gilles, Belaïd, Sonia, Dupressoir, François, Fouque, Pierre-Alain, Grégoire, Benjamin, Standaert, François-Xavier, Strub, Pierre-Yves, UCL - SST/ICTM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Barthe, Gilles, Belaïd, Sonia, Dupressoir, François, Fouque, Pierre-Alain, Grégoire, Benjamin, Standaert, François-Xavier, and Strub, Pierre-Yves

Abstract

Refreshing algorithms are a critical ingredient for secure masking. They are instrumental in enabling sound composability properties for complex circuits, and their randomness requirements dominate the performance overheads in (very) high-order masking. In this paper, we improve a proposal of mask refreshing algorithms from EUROCRYPT 2017 that has excellent implementation properties in software and hardware, in two main directions. First, we provide a generic proof that this algorithm is secure at arbitrary orders—a problem that was left open so far. We introduce parametrized non-interference as a new technical ingredient for this purpose that may be of independent interest. Second, we use automated tools to further explore the design space of such algorithms and provide the best known parallel mask refreshing gadgets for concretely relevant security orders. Incidentally, we also prove the security of a recent proposal of mask refreshing with improved resistance against horizontal attacks from CHES 2017.

Published
2020

Catalog

Books, media, physical & digital resources
See catalog results