Research Papers

Filter by:

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.

CSI-Otter: Isogeny-based (Partially) Blind Signatures from the Class Group Action with a Twist

In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme. (journal version)

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.

WrapQ: Side-Channel Secure Key Management for Post-quantum Cryptography

In this work, we study key handling techniques used in real-life secure Kyber and Dilithium hardware. We describe WrapQ, a masking-friendly key-wrapping mechanism designed for lattice cryptography.

Finding Short Integer Solutions When the Modulus Is Small

We present cryptanalysis of the inhomogenous short integer solution problem for anomalously small moduli q by exploiting the geometry of BKZ reduced bases of q-ary lattices.

CSI-Otter: Isogeny-Based (Partially) Blind Signatures from the Class Group Action with a Twist

In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme.

Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation

We present Bingo, an adaptively secure and optimally resilient packed asynchronous verifiable secret sharing (PAVSS) protocol.

Fully Adaptive Schnorr Threshold Signatures

We prove adaptive security of a simple three-round threshold Schnorr signature scheme, which we call Sparkle+.

Snowblind: A Threshold Blind Signature in Pairing-Free Groups

Both threshold and blind signatures have, individually, received a considerable amount of attention. However little is known about their combination.