000217020 001__ 217020
000217020 005__ 20190317000414.0
000217020 037__ $$aCONF
000217020 245__ $$aEfficiently Making Secure Two-Party Computation Fair
000217020 269__ $$a2016
000217020 260__ $$c2016
000217020 336__ $$aConference Papers
000217020 520__ $$aSecure two-party computation cannot be fair against malicious adversaries, unless a trusted third party (TTP) or a gradual-release type super-constant round protocol is employed. Existing optimistic fair two-party computation protocols with constant rounds are either too costly to arbitrate (e.g., the TTP may need to re-do almost the whole computation), or require the use of electronic payments. Furthermore, most of the existing solutions were proven secure and fair via a partial simulation, which, we show, may lead to insecurity overall. We propose a new framework for fair and secure two-party computation that can be applied on top of any secure two party computation protocol based on Yao's garbled circuits and zero-knowledge proofs. We show that our fairness overhead is minimal, compared to all known existing work. Furthermore, our protocol is fair even in terms of the work performed by Alice and Bob. We also prove our protocol is fair and secure simultaneously, through one simulator, which guarantees that our fairness extensions do not leak any private information. Lastly, we ensure that the TTP never learns the inputs or outputs of the computation. Therefore, even if the TTP becomes malicious and causes unfairness by colluding with one party, the security of the underlying protocol is still preserved.
000217020 6531_ $$atwo party computation
000217020 6531_ $$agarbled circuit
000217020 6531_ $$aYao's protocol
000217020 6531_ $$afair computation
000217020 6531_ $$aoptimistic model
000217020 700__ $$0248945$$aKilinç, Handan$$g243751
000217020 700__ $$aKüpçü, Alptekin
000217020 7112_ $$aFinancial Crypto$$cBarbados$$d2016
000217020 8564_ $$uhttp://fc16.ifca.ai/preproceedings/11_Kilinc.pdf$$zURL
000217020 8564_ $$s563901$$uhttps://infoscience.epfl.ch/record/217020/files/11_Kilinc.pdf$$yn/a$$zn/a
000217020 909C0 $$0252183$$pLASEC$$xU10433
000217020 909CO $$ooai:infoscience.tind.io:217020$$pconf$$pIC$$qGLOBAL_SET
000217020 917Z8 $$x243751
000217020 937__ $$aEPFL-CONF-217020
000217020 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000217020 980__ $$aCONF