Cryptology ePrint Archive: Report 2007/133
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
Abstract: 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. As an important application, 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.
Category / Keywords: cryptographic protocols/Conditional disclosure of secrets, homomorphic encryption, oblivious transfer
Publication Info: Accepted to ISC 2008
Date: received 17 Apr 2007, last revised 19 Jun 2008
Contact author: h lipmaa at cs ucl ac uk
Available formats: PDF | BibTeX Citation
Note: Changes are only decorative compared to July 2007 version.
Version: 20080619:092138 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]