Amortizing Secure Computation with Penalties

@inproceedings{Kumaresan2016AmortizingSC,
  title={Amortizing Secure Computation with Penalties},
  author={Ranjit Kumaresan and Iddo Bentov},
  booktitle={ACM Conference on Computer and Communications Security},
  year={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 guarantees that either fairness is guaranteed or that each honest party obtains a monetary penalty from the… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

4 Figures & Tables

Topics

Statistics

0102020172018
Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.