Improvements to Secure Computation with Penalties
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 o...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computing Machinery
2017
|
| Online Access: | http://hdl.handle.net/1721.1/112961 https://orcid.org/0000-0003-3022-3443 https://orcid.org/0000-0002-2666-0045 https://orcid.org/0000-0002-0522-7023 |