scispace - formally typeset
T

Thomas Espitau

Researcher at Pierre-and-Marie-Curie University

Publications -  43
Citations -  656

Thomas Espitau is an academic researcher from Pierre-and-Marie-Curie University. The author has contributed to research in topics: Probabilistic logic & Cryptography. The author has an hindex of 12, co-authored 42 publications receiving 450 citations. Previous affiliations of Thomas Espitau include Centre national de la recherche scientifique & University of Paris.

Papers
More filters
Book ChapterDOI

Relational Reasoning via Probabilistic Coupling

Gilles Barthe, +5 more
TL;DR: In this paper, the authors show that the relational program logic pRHL, the logic underlying the EasyCrypt cryptographic proof assistant, already internalizes a generalization of probabilistic coupling.
Book ChapterDOI

Masking the GLP Lattice-Based Signature Scheme at Any Order

Gilles Barthe, +7 more
TL;DR: 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.
Book ChapterDOI

Computing Generator in Cyclotomic Integer Rings

Jean-François Biasse, +5 more
TL;DR: A heuristic algorithm that solves the PIP in prime-power cyclotomic fields in subexponential time and allows to recover in practice the secret key of the Smart and Vercauteren scheme, for the smallest proposed parameters (in dimension 256).
Journal ArticleDOI

Loop-Abort Faults on Lattice-Based Signature Schemes and Key Exchange Protocols

Thomas Espitau, +3 more
- 01 Nov 2018 - 
TL;DR: This paper presents several fault attacks against those schemes that recover the entire key recovery with only a few faulty executions, show that those attacks can be mounted in practice based on concrete experiments in hardware, and discuss possible countermeasures against them.
Journal Article

Masking the GLP Lattice-Based Signature Scheme at Any Order.

Gilles Barthe, +6 more
- 01 Jan 2018 - 
TL;DR: 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.