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 …

We develop a general approach to adding a threshold functionality to a large class of (non-
threshold) cryptographic schemes. A threshold functionality enables a secret key to be split …

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 …

Multi-signatures are protocols that allow a group of signers to jointly produce a single
signature on the same message. In recent years, a number of practical multi-signature …

We introduce a novel generic ring signature construction, called DualRing, which can be
built from several canonical identification schemes (such as Schnorr identification) …

Although they have been studied for a long time, distributed signature protocols have
garnered renewed interest in recent years in view of novel applications to topics like …

We introduce MatRiCT, an efficient RingCT protocol for blockchain confidential transactions,
whose security is based on" post-quantum''(module) lattice assumptions. The proof length of …

We provide new zero-knowledge argument of knowledge systems that work directly for a
wide class of language, namely, ones involving the satisfiability of matrix-vector relations …

We propose a very fast lattice-based zero-knowledge proof system for exactly proving
knowledge of a ternary solution ⃗ s ∈ {-1, 0, 1\}^ ns→∈-1, 0, 1 n to a linear equation A ⃗ s …

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 …