Paper Info
Title
Masking the GLP Lattice-Based Signature Scheme at Any Order.
Abstract
Recently, numerous physical attacks have been demonstrated against lattice-based schemes, often exploiting their unique properties such as the reliance on Gaussian distributions, rejection sampling and FFT-based polynomial multiplication. As the call for concrete implementations and deployment of postquantum cryptography becomes more pressing, protecting against those attacks is an important problem. However, few countermeasures have been proposed so far. In particular, masking has been applied to the decryption procedure of some lattice-based encryption schemes, but the much more difficult case of signatures (which are highly non-linear and typically involve randomness) has not been considered until now. In this paper, we describe the first masked implementation of a lattice-based signature scheme. Since masking Gaussian sampling and other procedures involving contrived probability distribution would be prohibitively inefficient, we focus on the GLP scheme of Guneysu, Lyubashevsky and Poppelmann (CHES 2012). We show how to provably mask it in the Ishai-Sahai-Wagner model (CRYPTO 2003) at any order in a relatively efficient manner, using extensions of the techniques of Coron et al. for converting between arithmetic and Boolean masking. Our proof relies on a mild generalization of probing security that supports the notion of public outputs. We also provide a proof-of-concept implementation to assess the efficiency of the proposed countermeasure.
Year
DOI
Venue
2018
10.1007/978-3-319-78375-8_12
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II
Keywords
DocType
Volume
Side-channel,Masking,GLP lattice-based signature
Journal
10821
ISSN
Citations 
PageRank 
0302-9743
2
0.41
References 
Authors
16
7
Name
Order
Citations
PageRank
Gilles Barthe12337152.36
Sonia Belaïd2916.59
Thomas Espitau3499.18
Pierre-Alain Fouque41762107.22
Benjamin Grégoire581748.93
Melissa Rossi661.86
Mehdi Tibouchi798955.45