We present a much-improved practical protocol, based on the hardness of Module-SIS and
Module-LWE problems, for proving knowledge of a short vector s→ satisfying A s→= t→ mod …

Non-interactive publicly verifiable secret sharing (PVSS) schemes enables (re-) sharing of
secrets in a decentralized setting in the presence of malicious parties. A recently proposed …

Blind signatures, proposed by Chaum (CRYPTO'82), are interactive protocols between a
signer and a user, where a user can obtain a signature without revealing the message to be …

We present a framework for building practical anonymous credential schemes based on the
hardness of lattice problems. The running time of the prover and verifier is independent of …

In a set membership proof, the public information consists of a set of elements and a
commitment. The prover then produces a zero-knowledge proof showing that the …

Several prior works have suggested to use non-interactive arguments of knowledge with
short proofs to aggregate signatures of Falcon, which is part of the first post-quantum …

Recent works on lattice-based extractable polynomial commitments can be grouped into two
classes:(i) non-interactive constructions that stem from the functional commitment by …

We present an improved lattice-based group signature scheme whose parameter sizes and
running times are independent of the group size. The signature length in our scheme is …

We introduce MatRiCT+, a practical private blockchain payment protocol based on “post-
quantum” lattice assumptions. MatRiCT+ builds on MatRiCT due to Esgin et al.(ACM …

The MPC-in-the-Head paradigm is instrumental in building zero-knowledge proof systems
and post-quantum signatures using techniques from secure multi-party computation. In this …