Paper Info
Title
Improved Parallel Mask Refreshing Algorithms: Generic Solutions with Parametrized Non-Interference & Automated Optimizations.
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.
Year
DOI
Venue
2018
10.1007/s13389-018-00202-2
IACR Cryptology ePrint Archive
Keywords
DocType
Volume
Side-channel attacks, Masking countermeasure, Refreshing algorithms, Composability
Journal
2018
Issue
ISSN
Citations 
1
2190-8516
1
PageRank 
References 
Authors
0.35
0
7
Name
Order
Citations
PageRank
Gilles Barthe12337152.36
Sonia Belaïd2916.59
François Dupressoir31749.68
Pierre-Alain Fouque41762107.22
Benjamin Grégoire581748.93
François-Xavier Standaert63070193.51
Pierre-Yves Strub754029.87