Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family

Maji, Hemanta K.; Nguyen, Huy Hung; Paskin-Cherniavsky, Anat; Suad, Tom; Wang, Mingyuan; Ye, Xiuyu; Yu, Albert

doi:10.1007/978-3-031-22318-1_13

Cited by 3 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on this state of the art, the main goal of this paper is to provide theoretical explanations for previous empirical observations on prime-field masking, in order to establish foundations on which prime ciphers could be designed. Interestingly, it turns out that the case of bit (e.g., LSB) leakages has been the topic of (for now mostly theoretical) investigations in the context of leakageresilient secret sharing, and extended towards any deterministic leakage model with a bounded range [7,27,31,8,28,30,29]. Among others, these works show that bit leakages are in some sense the most powerful leakage functions with bounded range, which therefore raises the question whether more positive results could be obtained for other, ideally more realistic, leakage functions.…”

Section: Introductionmentioning

confidence: 99%

Connecting Leakage-Resilient Secret Sharing to Practice: Scaling Trends and Physical Dependencies of Prime Field Masking

Faust,

Masure,

Micheli

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Symmetric ciphers operating in (small or mid-size) prime fields have been shown to be promising candidates to maintain security against low-noise (or even noise-free) side-channel leakage. In order to design prime ciphers that best trade physical security and implementation efficiency, it is essential to understand how side-channel security evolves with the field size (i.e., scaling trends). Unfortunately, it has also been shown that such scaling trends depend on the leakage functions and cannot be explained by the standard metrics used to analyze Boolean masking with noise. In this work, we therefore initiate a formal study of prime field masking for two canonical leakage functions: bit leakages and Hamming weight leakages. By leveraging theoretical results from the leakage-resilient secret sharing literature, we explain formally why (1) bit leakages correspond to a worst-case and do not encourage operating in larger fields, and (2) an opposite conclusion holds for Hamming weight leakages, where increasing the prime field modulus p can contribute to a security amplification that is exponential in the number of shares, with log(p) seen as security parameter like the noise variance in Boolean masking. We combine these theoretical results with simulated experiments and show that the interest masking in larger prime fields can degrade gracefully when leakage functions slightly deviate from the Hamming weight abstraction, motivating further research towards characterizing (ideally wide) classes of leakage functions offering such guarantees.

show abstract