Cryptology ePrint Archive: Report 2010/449

Oblivious and Fair Server-Aided Two-Party Computation

Amir Herzberg and Haya Shulman

Abstract: We show efficient, practical (server-aided) secure two-party computation protocols ensuring privacy, correctness and fairness in the presence of malicious (Byzantine) faults. Our requirements from the server are modest: to ensure privacy and correctness, we only assume offline set-up prior to protocol execution; and to also ensure fairness, we further assume a trusted-decryption service, providing decryption service using known public key. The fairness-ensuring protocol is optimistic, i.e., the decryption service is invoked only in case of faults. Both assumptions are feasible in practice and formally presented in the hybrid model. The resulting protocols may be sufficiently efficient, to allow deployment, in particular for financial applications.

Category / Keywords: Two-party computation, fair optimistic protocols, server-aided computation

Publication Info: International Conference on Availability, Reliability and Security (ARES) 2012

Date: received 18 Aug 2010, last revised 19 Oct 2012

Contact author: haya shulman at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20121019:131337 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]