Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on
their private inputs, and reveals nothing but the output of the function. In the last decade …

We present new protocols for Asynchronous Verifiable Secret Sharing for Shamir (ie,
threshold t< n) sharing of secrets. Our protocols: Use only “lightweight” cryptographic …

We outline a secure and efficient methodology to do threshold distributed decryption for
LWE based Fully Homomorphic Encryption schemes. Due to the smaller parameters used in …

Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient
verification of NP computations and admit short proofs. However, all current SNARK …

Mixing arithmetic and boolean circuits to perform privacy-preserving machine learning has
become increasingly popular. Towards this, we propose a framework for the case of four …

We study when (dual) Vandermonde systems of the form V _T^(\intercal) ⋅ z= s ⋅ w VT (⊺)·
z= s· w admit a solution zz over a ring RR, where V _T VT is the Vandermonde matrix …

We introduce a class of interactive protocols, which we call sumcheck arguments, that
establishes a novel connection between the sumcheck protocol (Lund et al. JACM 1992) …

In the last few years, the efficiency of secure multi-party computation (MPC) in the dishonest
majority setting has increased by several orders of magnitudes starting with the SPDZ …

We propose and implement a multiparty homomorphic encryption (MHE) scheme with at-out-
of-N-threshold access-structure that is efficient and does not require a trusted dealer in the …

The growing volumes of data being collected and its analysis to provide better services are
creating worries about digital privacy. To address privacy concerns and give practical …