## CryptoDB

### Paper: New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

Authors: Helger Lipmaa URL: http://eprint.iacr.org/2007/133 Search ePrint Search Google We construct two simple families of two-message $(n,1)$-oblivious transfer protocols based on degree-$t$ homomorphic cryptosystems with the communication of respectively $1+\lceil n/t\rceil$ and $3+\lceil n/(t+1)\rceil$ ciphertexts. The construction of both families relies on efficient cryptocomputable conditional disclosure of secret protocols; the way this is done may be of independent interest. The currently most interesting case $t=2$ can be based on the Boneh-Goh-Nissim cryptosystem. We show how to reduce the communication of virtually any existing oblivious transfer protocols by proposing a new related communication-efficient generic transformation from computationally-private information retrieval protocols to oblivious transfer protocols.
##### BibTeX
@misc{eprint-2007-13415,
title={New Communication-Efficient Oblivious Transfer Protocols Based on Pairings},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols/Conditional disclosure of secrets, homomorphic encryption, oblivious transfer},
url={http://eprint.iacr.org/2007/133},
note={ h.lipmaa@cs.ucl.ac.uk 13673 received 17 Apr 2007, last revised 9 Jun 2007},
author={Helger Lipmaa},
year=2007
}