Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure distributed computing. It
is used as a building block in several distributed computing tasks, such as Byzantine …

In this paper, we introduce the problem of Asynchronous Data Dissemination (ADD).
Intuitively, an ADD protocol disseminates a message to all honest nodes in an …

With the rapid development of information technology, Big data has become a hot topic of
research in governments, academia, and enterprises. On the one hand, Big data brings …

Secure multi-party computation (MPC) allows a set of n parties to jointly compute a function
over their private inputs. The seminal works of Ben-Or, Canetti and Goldreich [STOC'93] and …

We put forward a non-interactive verifiable secret sharing (NI-VSS) scheme using class
groups-we call it cgVSS. Our construction follows the standard framework of encrypting the …

We present Bingo, an adaptively secure and optimally resilient packed asynchronous
verifiable secret sharing (PAVSS) protocol that allows a dealer to share f+ 1 secrets with a …

In this work we present Bingo, an adaptively secure and optimally resilient packed
asynchronous verifiable secret sharing (PAVSS) protocol that allows a dealer to share f+ 1 …

Despite significant recent progress toward making multi-party computation (MPC) practical,
no existing MPC library offers complete robustness---meaning guaranteed output delivery …

Distributed key generation (DKG) protocols are an essential building block for threshold
cryptosystems. Many DKG protocols tolerate up to ts< n/2 corruptions assuming a well …

Secure multiparty computation (MPC) allows a set of n parties to jointly compute a function
on their private inputs. In this work, we focus on the information-theoretic MPC in the …