You are looking at a specific version 20180213:211623 of this paper. See the latest version.

Paper 2017/1187

On the Round Complexity of OT Extension

Sanjam Garg and Mohammad Mahmoody and Daniel Masny and Izaak Meckler

Abstract

We show that any OT extension protocol based on one-way functions (or more generally any symmetric-key primitive) either requires an additional round compared to the base OTs or must make a non-black-box use of one-way functions. This result also holds in the semi-honest setting or in the case of certain setup models such as the common random string model. This implies that OT extension in any secure computation protocol must come at the price of an additional round of communication or the non-black-box use of symmetric key primitives. Moreover, we observe that our result is tight in the sense that positive results can indeed be obtained using non-black-box techniques or at the cost of one additional round of communication.

Note: Fixing typos.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Oblivious Transfer ExtensionSymmetric Key PrimitivesRandom Oracle ModelBlack-BoxNon-Black-Box
Contact author(s)
mahmoody @ gmail com
daniel masny @ berkeley edu
History
2018-06-03: last of 4 revisions
2017-12-12: received
See all versions
Short URL
https://ia.cr/2017/1187
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.