A zk-SNARK is a powerful cryptographic primitive that provides a succinct and efficiently
checkable argument that the prover has a witness to a public NP statement, without …

We present a novel approach to honest majority secure multiparty computation in the
preprocessing model with information theoretic security that achieves the best online …

A unit-vector (UV) correlation is an additive secret-sharing of a vector of length B that
contains 1 in a secret random position and 0's elsewhere. UV correlations are a useful …

In the recent work of (Cheon & Lee, Eurocrypt'22), the concept of a degree-D packing
method was formally introduced, which captures the idea of embedding multiple elements of …

We present Rabbit-Mix, a robust algebraic mixing-based anonymous broadcast protocol in
the client-server model. Rabbit-Mix is the first practical sender-anonymous broadcast …

Private information retrieval (PIR) is a technique for a client to retrieve an item from a public
database without revealing to an adversarial server the item that was queried. While multi …

Threshold Schnorr signatures are seeing increased adoption in practice, and offer practical
defenses against single points of failure. However, one challenge with existing randomized …

This paper examines multi-party computation protocols in the presence of two major
constraints commonly encountered in deployed systems. Firstly, we consider the situation …

Multiparty computation (MPC) over rings such as Z264 has received a great deal of attention
recently due to its ease of implementation and attractive performance. We assume there are …

Through tremendous efforts, the communication cost of secure multi-party computation
(MPC) in the honest-majority setting has been significantly improved. In particular, the state …