Name
Abstract | ||
|---|---|---|
In the context of two-party computation, such as file exchange or contract signing, the security property of fairness is of great importance. After the impossibility result of Cleve for achieving complete fairness in general, recent research proposes to circumvent such impossibility by assuming that parties behave as rational players of a game. However, such works involve rational parties as independent individuals without considering the impact of the environment. In our work, we apply the notion of social conformity to show that under certain assumptions rational parties belonging to a cloud will choose to cooperate. Then, we simulate a real setting to show that party in fact cooperates and achieves fairness. Finally we discuss a general model to describe the connection between mutual cooperation in social conformity and fairness in secure two-party computation. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jpdc.2017.06.006 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Game theory,Cloud cooperation,Fairness,Social conformity | Computer science,Computer security,Impossibility,Game theory,Conformity,Cloud computing,Computation,Distributed computing | Journal |
Volume | ISSN | Citations |
117 | 0743-7315 | 7 |
PageRank | References | Authors |
0.44 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao Li | 1 | 29 | 6.40 |
| Brij Bhooshan Gupta | 2 | 156 | 9.95 |
| Roberto Metere | 3 | 12 | 1.86 |