Perfectly secure message transmission (PSMT), a problem formulated by Dolev, Dwork, Waarts and Yung, involves a sender S and a recipient R who are connected by n synchronous channels of which up to tâ€¦ (More)

All known protocols for Byzantine agreement (BA) among <i>n</i> players require the message to be communicated at least Ω(<i>n</i><sup>2</sup>) times, which results in an overall communicationâ€¦ (More)

We consider perfect verifiable secret sharing (VSS) in a synchronous network of n processors (players) where a designated player called the dealer wishes to distribute a secret s among the players inâ€¦ (More)

This paper considers unconditionally secure protocols for reliable broadcast among a set of n players, some of which may be corrupted by an active (Byzantine) adversary. In the standard model with aâ€¦ (More)

It is well-known that <i>n</i> players, connected only by pairwise secure channels, can achieve Byzantine agreement only if the number <i>t</i> of cheaters satisfies <i>t</i> < <i>n</i>/3, evenâ€¦ (More)

We show that if a set of players hold shares of a value a âˆˆ Zp for some prime p (where the set of shares is written [a]p), it is possible to compute, in constant round and with unconditionalâ€¦ (More)

It is well-known that n players, connected only by pairwise secure channels, can achieve unconditional broadcast if and only if the number t of cheaters satisfies t < n/3. In this paper, we show thatâ€¦ (More)

This paper improves on the classical results in unconditionally secure multi-party computation among a set of n players, by considering a model with three simultaneously occurring types of playerâ€¦ (More)

We consider a generalized adversary model for unconditionally secure multi-party computation. The adversary can actively corrupt (i.e. take full control over) a subset D P of the players, and,â€¦ (More)