Efficient and Private Computations with Code-Based Masking
Code-based masking is a very general type of masking scheme that covers Boolean masking, inner product masking, direct sum masking, and so on. The merits of the generalization are twofold. Firstly, the higher algebraic complexity of the sharing function decreases the information leakage in “low nois...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ruhr-Universität Bochum
2020-03-01
|
| Series: | Transactions on Cryptographic Hardware and Embedded Systems |
| Subjects: | |
| Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/8547 |
| _version_ | 1818533404283502592 |
|---|---|
| author | Weijia Wang Pierrick Méaux Gaëtan Cassiers François-Xavier Standaert |
| author_facet | Weijia Wang Pierrick Méaux Gaëtan Cassiers François-Xavier Standaert |
| author_sort | Weijia Wang |
| collection | DOAJ |
| description | Code-based masking is a very general type of masking scheme that covers Boolean masking, inner product masking, direct sum masking, and so on. The merits of the generalization are twofold. Firstly, the higher algebraic complexity of the sharing function decreases the information leakage in “low noise conditions” and may increase the “statistical security order” of an implementation (with linear leakages). Secondly, the underlying error-correction codes can offer improved fault resistance for the encoded variables. Nevertheless, this higher algebraic complexity also implies additional challenges. On the one hand, a generic multiplication algorithm applicable to any linear code is still unknown. On the other hand, masking schemes with higher algebraic complexity usually come with implementation overheads, as for example witnessed by inner-product masking. In this paper, we contribute to these challenges in two directions. Firstly, we propose a generic algorithm that allows us (to the best of our knowledge for the first time) to compute on data shared with linear codes. Secondly, we introduce a new amortization technique that can significantly mitigate the implementation overheads of code-based masking, and illustrate this claim with a case study. Precisely, we show that, although performing every single code-based masked operation is relatively complex, processing multiple secrets in parallel leads to much better performances. This property enables code-based masked implementations of the AES to compete with the state-of-the-art in randomness complexity. Since our masked operations can be instantiated with various linear codes, we hope that these investigations open new avenues for the study of code-based masking schemes, by specializing the codes for improved performances, better side-channel security or improved fault tolerance. |
| first_indexed | 2024-12-11T17:58:15Z |
| format | Article |
| id | doaj.art-8c173100c1b64cd09ae6d8c951f484b5 |
| institution | Directory Open Access Journal |
| issn | 2569-2925 |
| language | English |
| last_indexed | 2024-12-11T17:58:15Z |
| publishDate | 2020-03-01 |
| publisher | Ruhr-Universität Bochum |
| record_format | Article |
| series | Transactions on Cryptographic Hardware and Embedded Systems |
| spelling | doaj.art-8c173100c1b64cd09ae6d8c951f484b52022-12-22T00:55:59ZengRuhr-Universität BochumTransactions on Cryptographic Hardware and Embedded Systems2569-29252020-03-012020210.13154/tches.v2020.i2.128-171Efficient and Private Computations with Code-Based MaskingWeijia Wang0Pierrick Méaux1Gaëtan Cassiers2François-Xavier Standaert3Crypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, BelgiumCrypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, BelgiumCrypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, BelgiumCrypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, BelgiumCode-based masking is a very general type of masking scheme that covers Boolean masking, inner product masking, direct sum masking, and so on. The merits of the generalization are twofold. Firstly, the higher algebraic complexity of the sharing function decreases the information leakage in “low noise conditions” and may increase the “statistical security order” of an implementation (with linear leakages). Secondly, the underlying error-correction codes can offer improved fault resistance for the encoded variables. Nevertheless, this higher algebraic complexity also implies additional challenges. On the one hand, a generic multiplication algorithm applicable to any linear code is still unknown. On the other hand, masking schemes with higher algebraic complexity usually come with implementation overheads, as for example witnessed by inner-product masking. In this paper, we contribute to these challenges in two directions. Firstly, we propose a generic algorithm that allows us (to the best of our knowledge for the first time) to compute on data shared with linear codes. Secondly, we introduce a new amortization technique that can significantly mitigate the implementation overheads of code-based masking, and illustrate this claim with a case study. Precisely, we show that, although performing every single code-based masked operation is relatively complex, processing multiple secrets in parallel leads to much better performances. This property enables code-based masked implementations of the AES to compete with the state-of-the-art in randomness complexity. Since our masked operations can be instantiated with various linear codes, we hope that these investigations open new avenues for the study of code-based masking schemes, by specializing the codes for improved performances, better side-channel security or improved fault tolerance.https://tches.iacr.org/index.php/TCHES/article/view/8547Side-channel attacksMaskingLinear CodesCode-based Masking |
| spellingShingle | Weijia Wang Pierrick Méaux Gaëtan Cassiers François-Xavier Standaert Efficient and Private Computations with Code-Based Masking Transactions on Cryptographic Hardware and Embedded Systems Side-channel attacks Masking Linear Codes Code-based Masking |
| title | Efficient and Private Computations with Code-Based Masking |
| title_full | Efficient and Private Computations with Code-Based Masking |
| title_fullStr | Efficient and Private Computations with Code-Based Masking |
| title_full_unstemmed | Efficient and Private Computations with Code-Based Masking |
| title_short | Efficient and Private Computations with Code-Based Masking |
| title_sort | efficient and private computations with code based masking |
| topic | Side-channel attacks Masking Linear Codes Code-based Masking |
| url | https://tches.iacr.org/index.php/TCHES/article/view/8547 |
| work_keys_str_mv | AT weijiawang efficientandprivatecomputationswithcodebasedmasking AT pierrickmeaux efficientandprivatecomputationswithcodebasedmasking AT gaetancassiers efficientandprivatecomputationswithcodebasedmasking AT francoisxavierstandaert efficientandprivatecomputationswithcodebasedmasking |