Improvements to Secure Computation with Penalties
Ranjit Kumaresan, Vinod Vaikuntanathan, Prashant Nalini Vasudevan · 2016
Motivated by the impossibility of achieving fairness in secure computation [Cleve, STOC 1986], recent works study a model of fairness in which an adversarial party that aborts on receiving output is forced to pay a mutually predefined monetary penalty to every other party that did not receive the output. These works show how to design protocols for secure computation with penalties that tolerate an arbitrary number of corruptions.