### Universally Composable Adaptive Oblivious Transfer

Matthew Green and Susan Hohenberger

##### Abstract

In an oblivious transfer (OT) protocol, a Sender with messages M_1,...,M_N and a Receiver with indices s_1,...,s_k interact in such a way that at the end the Receiver obtains M_{s_1},...,M_{s_k} without learning anything about the other messages, and the Sender does not learn anything about s_1,...,s_k. In an adaptive protocol, the Receiver may obtain M_{s_{i-1}} before deciding on $s_i$. Efficient adaptive OT protocols are interesting both as a building block for secure multiparty computation and for enabling oblivious searches on medical and patent databases. Historically, adaptive OT protocols were analyzed with respect to a half-simulation'' definition which Naor and Pinkas showed to be flawed. In 2007, Camenisch, Neven, and shelat, and subsequent other works, demonstrated efficient adaptive protocols in the full-simulation model. These protocols, however, all use standard rewinding techniques in their proofs of security and thus are not universally composable. Recently, Peikert, Vaikuntanathan and Waters presented universally composable (UC) non-adaptive OT protocols (for the 1-out-of-2 variant). However, it is not clear how to preserve UC security while extending these protocols to the adaptive k-out-of-N setting. Further, any such attempt would seem to require O(N) computation per transfer for a database of size N. In this work, we present an efficient and UC-secure adaptive k-out-of-N OT protocol, where after an initial commitment to the database, the cost of each transfer is constant. Our construction is secure under bilinear assumptions in the standard model.

Note: Added a clarification on page 10 regarding the security of a signature variant we used.

Available format(s)
Category
Cryptographic protocols
Publication info
Published elsewhere. To appear in ASIACRYPT 2008.
Keywords
oblivious transferUC securitybilinear maps
Contact author(s)
mgreen @ cs jhu edu
History
2013-09-14: last of 7 revisions
See all versions
Short URL
https://ia.cr/2008/163

CC BY

BibTeX

@misc{cryptoeprint:2008/163,
author = {Matthew Green and Susan Hohenberger},
title = {Universally Composable Adaptive Oblivious Transfer},
howpublished = {Cryptology ePrint Archive, Paper 2008/163},
year = {2008},
note = {\url{https://eprint.iacr.org/2008/163}},
url = {https://eprint.iacr.org/2008/163}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.