“…For one thing, work has continued on secret sharing and multiparty computation, taking faulty and rational behavior into account (e.g., [Abraham, Dolev, Gonen, and Halpern 2006;Dani, Movahedi, Rodriguez, and Saia 2011;Fuchsbauer, Katz, and Naccache 2010;Gordon and Katz 2006;Lysyanskaya and Triandopoulos 2006]). There has also been work on when and whether a problem that can be solved with a trusted third party can be converted to one that can be solved using cheap talk, without a third party, a problem that has also attracted the attention of game theorists (e.g., [Abraham, Dolev, Gonen, and Halpern 2006;Abraham, Dolev, and Halpern 2008;Barany 1992;Ben-Porath 2003;Dodis, Halevi, and Rabin 2000;Forges 1990;Heller 2005;Izmalkov, Lepinski, and Micali 2011;Lepinski, Micali, Peikert, and Shelat 2004;McGrew, Porter, and Shoham 2003;Shoham and Tennenholtz 2005;Urbano and Vila 2002;Urbano and Vila 2004]). This is relevant because there are a number of well-known distributed computing problems that can be solved easily by means of a "trusted" mediator.…”