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 a seminal paper, Feldman and Micali (STOC'88) show an n-party Byzantine agreement
protocol tolerating t< n/3 malicious parties that runs in expected constant rounds. Here, we …

A (t, n) secret sharing divides a secret into n shares in such a way that any t or more than t
shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In …

parties to securely compute an agreed function f over some finite field in the presence of a
computationally unbounded adversary, who can maliciously corrupt any t out of the n …

Verifiable secret sharing (VSS) is an important primitive in distributed cryptography that
allows a dealer to share a secret among n parties in the presence of an adversary …

Recently, a polynomial-based (k, n) steganography and authenticated image sharing (SAIS)
scheme was proposed to share a secret image into n stego-images. At the same time, one …

In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in
the plain model that tolerates t< n/3 malicious parties and runs in expected constant rounds …

Abstract Recently, Aumann and Lindell introduced a new realistic security model for secure
computation, namely, security against covert adversaries. The main motivation was to obtain …

Secure multi-party computation (MPC) is a fundamental problem in secure distributed
computing. The optimal resilience for perfectly-secure MPC in synchronous and …

We revisit the question of secure multiparty computation (MPC) with two rounds of
interaction. It was previously shown by Gennaro et al.(Crypto 2002) that 3 or more …