Cryptology ePrint Archive: Report 2013/099

Secure Two-Party Computation via Leaky Generalized Oblivious Transfer

Samuel Ranellucci and Alain Tapp

Abstract: We construct a very efficient protocol for constant round Two-Party Secure Function Evaluation based on general assumptions. We define and instantiate a leaky variant of Generalized Oblivious Transfer based on Oblivious Transfer and Commitment Schemes. The concepts of Garbling Schemes, Leaky Generalized Oblivious Transfer and Privacy Amplification are combined using the Cut-and-Choose paradigm to obtain the final protocol. Our solution is proven secure in the Universal Composability Paradigm.

Category / Keywords: cryptographic protocols / Secure Function Evaluation, Oblivious Transfer, Privacy Amplification, Universal Composability, Garbling Schemes, Generalized Oblivious Transfer

Date: received 21 Feb 2013

Contact author: alain tapp at gmail com, samuel_ran@hotmail com

Available format(s): PDF | BibTeX Citation

Version: 20130227:162924 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]