Research Article
Fair Secure Computation with Reputation Assumptions in the Mobile Social Networks
Box 2
The description of protocol II in the fail-stop setting.
Protocol II | (1) Step one: Both parties run functionality ShareGen to receive and , | where . | (2) Step two: For to , each party decides whether to exchange his shares with the other party | using the TFT strategy. We highlight two premises. | (a) Each party satisfies assumptions (a)–(c). | (b) Meanwhile, parties do not know exactly whether his opponent is a TFTer party. | Note: The utility assumptions and the incomplete information compel cooperation before round . | (3) Outputs: Parties decide the outputs according to messages they have received. |
|