We present a practical construction of an additively homomorphic commitment scheme
based on structured lattice assumptions, together with a zero-knowledge proof of opening …

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 …

A recent line of works–initiated by Gordon, Katz and Vaikuntanathan (Asiacrypt 2010)–gave
lattice-based constructions allowing users to authenticate while remaining hidden in a …

We devise new techniques for design and analysis of efficient lattice-based zero-knowledge
proofs (ZKP). First, we introduce one-shot proof techniques for non-linear polynomial …

We propose the first zero-knowledge argument with sub-linear communication complexity
for arithmetic circuit satisfiability over a prime p whose security is based on the hardness of …

We construct a practical lattice-based zero-knowledge argument for proving multiplicative
relations between committed values. The underlying commitment scheme that we use is the …

We present improved algorithms for gaussian preimage sampling using the lattice trapdoors
of (Micciancio and Peikert, CRYPTO 2012). The MP12 work only offered a highly optimized …

Zero-knowledge range proofs (ZKRPs) allow a prover to convince a verifier that a secret
value lies in a given interval. ZKRPs have numerous applications: from anonymous …