Konferans bildirisi Açık Erişim

Fast Optimistically Fair Cut-and-Choose 2PC

2017    Kupcu, Alptekin; Mohassel, Payman

Secure two party computation (2PC) is a well-studied problem with many real world applications. Due to Cleve's result on general impossibility of fairness, however, the state-of-the-art solutions only provide security with abort. We investigate fairness for 2PC in presence of a trusted Arbiter, in an optimistic setting where the Arbiter is not involved if the parties act fairly. Existing fair solutions in this setting are by far less efficient than the fastest unfair 2PC.