Research Papers

We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice.

In this work, we formally prove a tight security bound for SPHINCS+ using the EasyCrypt proof assistant, establishing greater confidence in the general security of the scheme and that of the parameter sets considered for standardization.

We construct an efficient dynamic group signature (or more generally an accountable ring signature) from isogeny and lattice assumptions.

In this work we prove lower bounds on the (communication) cost of maintaining a shared key among a dynamic group of users. Being "dynamic'' means one can add and remove users from the group.

In this paper, we analyze proofs based on the partitioning technique through a new lens.

This work presents a novel architecture of a high-performance NTT accelerator capable of performing both NTT and inverse NTT operations using a single set of hardware resources.

This work explores several architectural optimizations and proposes a high-performance and area-time (AT) product efficient hardware accelerator for Kyber.

In this paper, we describe the first masked implementation of a lattice-based signature scheme.

In this work, we revisit ARS. Our contributions are threefolds: First, we show that all previous definitions of ARS allow the users’ purchase history to leak.

The main focus of this work is on exploring short pairing-based NIZKs for all NP languages based on standard assumptions.

We introduce a toolkit for transforming lattice-based hash-and-sign signature schemes into masking-friendly signatures secure in the t-probing mod

Threshold signatures improve both availability and security of digital signatures by splitting the signing key into N shares handed out to different parties.