Broadcast and secure computation under reduced setup assumptions

The problems of broadcast and multi-party computation are usually treated with respect to a small number of standard models. In this overview, with respect to two important such standard models, we address the following questions. Can the same problems still be solved when assuming less? What happens if we try to tolerate more corrupted players than provably tolerable? We conclude with a protocol for multi-party computation based on almost no setup assumptions at all