Unconditional
Trust or structural assumption

Trusted dealer

In plain words

Someone trusted prepares random material for everyone in advance, then steps away.

Why it matters: Makes the later computation fast and secure, as long as the dealer was honest.

The details

On the map: hands out correlated randomness before the computation, then leaves

An entity that generates correlated randomness for the participants before a computation and then leaves[1]. It must not collude with anyone or leak what it handed out.

In practice the dealer is usually replaced by a computational offline phase or by trusted hardware.

Rests on

If any of these breaks, this breaks too.

If it falls

If this breaks, these break with it.

References

  1. Donald Beaver. Efficient Multiparty Protocols Using Circuit Randomization. Advances in Cryptology — CRYPTO ’91, 1991. doi:10.1007/3-540-46766-1_34