-
Chapter and Conference Paper
\(\mathsf {\textsf{Plover}}\) : Masking-Friendly Hash-and-Sign Lattice Signatures
We introduce a toolkit for transforming lattice-based hash-and-sign signature schemes into masking-friendly signatures secure in the t-probing model. Until now, efficiently masking lattice-based hash-and-sign sch...
-
Chapter and Conference Paper
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions
Threshold signatures improve both availability and security of digital signatures by splitting the signing key into N shares handed out to different parties. Later on, any subset of at least T parties can coopera...
-
Chapter and Conference Paper
A Key-Recovery Attack Against Mitaka in the t-Probing Model
Mitaka is a lattice-based signature proposed at Eurocrypt 2022. A key advertised feature of Mitaka is that it can be masked at high orders efficiently, making it attractive in scenarios where side-channel attacks...
-
Article
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable
The Signal protocol is a secure instant messaging protocol that underlies the security of numerous applications such as WhatsApp, Skype, Facebook Messenger among many others. The Signal protocol consists of tw...
-
Chapter and Conference Paper
Exact Lattice Sampling from Non-Gaussian Distributions
We propose a new framework for (trapdoor) sampling over lattices. Our framework can be instantiated in a number of ways. It allows for example to sample from uniform, affine and “product affine” distributions....
-
Chapter and Conference Paper
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-Quantum, State Leakage Secure, and Deniable
The Signal protocol is a secure instant messaging protocol that underlies the security of numerous applications such as WhatsApp, Skype, Facebook Messenger among many others. The Signal protocol consists of tw...
-
Chapter and Conference Paper
SoK: How (not) to Design and Implement Post-quantum Cryptography
Post-quantum cryptography has known a Cambrian explosion in the last decade. What started as a very theoretical and mathematical area has now evolved into a sprawling research field, complete with side-channel...
-
Chapter and Conference Paper
Cryptographic Divergences: New Techniques and New Applications
In the recent years, some security proofs in cryptography have known significant improvements by replacing the statistical distance with alternative divergences. We continue this line of research, both at a th...
-
Chapter and Conference Paper
Isochronous Gaussian Sampling: From Inception to Implementation
Gaussian sampling over the integers is a crucial tool in lattice-based cryptography, but has proven over the recent years to be surprisingly challenging to perform in a generic, efficient and provable secure m...
-
Chapter and Conference Paper
Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats
Many advanced lattice based cryptosystems require to sample lattice points from Gaussian distributions. One challenge for this task is that all current algorithms resort to floating-point arithmetic (FPA) at s...
-
Chapter and Conference Paper
Scalable Ciphertext Compression Techniques for Post-quantum KEMs and Their Applications
A multi-recipient key encapsulation mechanism, or \(\mathsf {m}\mathsf {KEM}\) ...
-
Chapter and Conference Paper
More Efficient Algorithms for the NTRU Key Generation Using the Field Norm
NTRU lattices [13] are a class of polynomial rings which allow for compact and efficient representations of the lattice basis, thereby offering very good performance characteristics for the asymmetric algorithms ...
-
Chapter and Conference Paper
Unifying Leakage Models on a Rényi Day
In the last decade, several works have focused on finding the best way to model the leakage in order to...
-
Chapter and Conference Paper
Grafting Trees: A Fault Attack Against the SPHINCS Framework
Because they require no assumption besides the preimage or collision resistance of hash functions, hash-based signatures are a unique and very attractive class of post-quantum primitives. Among them, the schem...
-
Chapter and Conference Paper
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
The Rényi divergence is a measure of divergence between distributions. It has recently found several applications in lattice-based cryptography. The contribution of this paper is twofold.
-
Chapter and Conference Paper
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
A procedure for sampling lattice vectors is at the heart of many lattice constructions, and the algorithm of Klein (SODA 2000) and Gentry, Peikert, Vaikuntanathan (STOC 2008) is currently the one that produces...
-
Chapter and Conference Paper
Efficient Identity-Based Encryption over NTRU Lattices
Efficient implementations of lattice-based cryptographic schemes have been limited to only the most basic primitives like encryption and digital signatures. The main reason for this limitation is that at the c...
