CryptoDB
Probing Secure Composability Without Fresh Randomness: Theory and Application to Ascon
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Side-channel attacks (SCAs) pose a significant threat to the implementations of lightweight ciphers, particularly in resource-constrained environments where masking—the primary countermeasure—is constrained by tight resource limitations. This makes it crucial to reduce the resource and randomness requirements of masking schemes. In this work, we investigate an approach to minimize the randomness complexity of masking algorithms. Specifically, we explore the theoretical foundations of higher-order masking schemes that eliminate the need for online (fresh) randomness by relying solely on offline randomness present in the initial input shares.We demonstrate that round-based ciphers with linear diffusion layers can support such deterministic composition, where the diffusion layer acts as a refresh subcircuit. This ensures that, up to a threshold number, probes placed across rounds remain independent. Based on this observation, we propose composition theorems for probing-secure masking. On the practical side, we instantiate our framework using known deterministic first- and second-order masked S-boxes and provide software implementations of Ascon’s protected permutation. |
BibTeX
@article{tches-2025-35999,
title={Probing Secure Composability Without Fresh Randomness: Theory and Application to Ascon},
journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},
publisher={Ruhr-Universität Bochum},
volume={2025},
pages={972-1009},
url={https://tches.iacr.org/index.php/TCHES/article/view/12435},
doi={10.46586/tches.v2025.i4.972-1009},
author={Vahid Jahandideh and Bart Mennink and Lejla Batina},
year=2025
}