Random Probing Security with Precomputation
Abstract: At Eurocrypt 2014, Duc, Dziembowski and Faust proposed the random probing model to bridge the gap between the probing model proposed at Crypto 2003 and the noisy model proposed at Eurocrypt 2013. Compared with the probing model whose noise in the leakages should (linearly) increase with the number of shares, the random probing model allows each variable leak its value with a probability p, which reflects the physical reality of side channels much better. In Crypto 2020, Belaïd et al. proposed the Random Probing Expandability (RPE) security ensuring the random probing security for arbitrary order masking algorithms with constant leakage probability. However, the complexity of existing RPE algorithms is much higher than that of the probing secure algorithms, which is short of practical usage. In this paper, we investigate the random probing security with precomputation, where a masked cryptographic implementation can be divided into two phases. The first phase, called preprocessing, .... https://ojs.ub.rub.de/index.php/TCHES/article/view/11943
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Random Probing Security with Precomputation ; volume:2025 ; number:1 ; year:2024
IACR transactions on cryptographic hardware and embedded systems ; 2025, Heft 1 (2024)
- Creator
-
Wang, Bohan
Ji, Fanjie
Sun, Yiteng
Wang, Weijia
- DOI
-
10.46586/tches.v2025.i1.523-551
- URN
-
urn:nbn:de:101:1-2412181757013.084919582721
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:33 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Wang, Bohan
- Ji, Fanjie
- Sun, Yiteng
- Wang, Weijia