Research Papers

Filter by:

Cryptanalysis of the Peregrine Lattice-Based Signature Scheme

In this paper, we show that Peregrine, one of the candidates in the ongoing Korean post-quantum cryptography competition, is no exception, by demonstrating a practical key recovery attack against it.

An Improved Threshold Homomorphic Cryptosystem Based on Class Groups

We present distributed key generation and decryption protocols for an additively homomorphic cryptosystem based on class groups, improving on a similar system proposed by Braun, Damgård, and Orlandi at CRYPTO '23.

Mask Compression: High-Order Masking on Memory-Constrained Devices

In this work, we introduce mask compression. This conceptually simple technique is based on standard, non-masked symmetric cryptography.

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.

Breaking Parallel ROS: Implication for Isogeny and Lattice-based Blind Signatures

In this work, we provide a simple and novel attack on blind signatures based on identification protocols performing parallel repetition to reduce the soundness error.

CV2EC: Getting the Best of Both Worlds

Converting CryptoVerif models to EasyCrypt: getting the best of both worlds.

Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with Rewinding

T-out-of-N threshold signatures have recently seen a renewed interest, with various types now available, each offering different tradeoffs. However, one property that has remained elusive is adaptive security.

Flood and submerse: Distributed Key Generation and Robust Threshold Signature from Lattices

We propose a new framework based on random submersions for constructing verifiable short secret sharing and showcase it to construct efficient threshold lattice-based signatures in the hash-and-sign paradigm, when based on noise flooding.

Two-Round Threshold Signature from Algebraic One-More Learning with Errors

In this work, we construct the first efficient two-round lattice-based threshold signature without relying on FHE or HTDC.

Formally verifying Kyber Episode V: Machine-checked IND-CCA security and correctness of ML-KEM in EasyCrypt

Using computer-assisted proof tools to ensure security and correctness of Kyber and NIST-standard ML-KEM.

The Three Body Problem: There’s more to building Silicon than what EDA tools currently help with

Electronic Design Automation (EDA) tooling facilitates the development of cutting edge technologies at the nanometre scale.

On Gaussian sampling, smoothing parameter and application to signatures

We present a general framework for polynomial-time lattice Gaussian sampling. Using our techniques, we gain around 200 bytes (>20%) on the signature size.