You are looking at a specific version 20130227:162924 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
Secure Function EvaluationOblivious TransferPrivacy AmplificationUniversal ComposabilityGarbling SchemesGeneralized Oblivious Transfer
Contact author(s)
alain tapp @ gmail com
samuel_ran @ hotmail com
History
2013-09-18: last of 3 revisions
2013-02-27: received
See all versions
Short URL
https://ia.cr/2013/099
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.