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 …

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 …

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 …

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 …

We settle the exact round complexity of three-party computation (3PC) in honest-majority
setting, for a range of security notions such as selective abort, unanimous abort, fairness and …

Motivated by the goal of improving the concrete efficiency of secure multiparty computation
(MPC), we revisit the question of MPC with only two rounds of interaction. We consider a …

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 …

We study broadcast protocols in the information-theoretic model under optimal conditions,
where the number of corruptions t is at most one-third of the parties, n. While worst-case Ω …

Abstract Secure Multi-Party Computation (MPC) providing information-theoretic security
allows a set of n parties to securely compute an agreed function over a finite field, even if t …

Cloud computing is an Internet-based computing. Computing services, such as data,
storage, software, computing, and application, are delivered to local devices through …