UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

Lipmaa, H; (2007) New Communication-Efficient Oblivious Transfer Protocols Based on Pairings. (IACR ePrint Archive 2007/133 ). IACR

Full text not available from this repository.

Abstract

We construct two simple families of two-message $(n,1)$-oblivious transfer protocols based on degree-$t$ homomorphic cryptosystems with communication of respectively $1+\ceil{n/t}$ and $3+\ceil{n/(t+1)}$ ciphertexts. The construction of both families relies on efficient cryptocomputable conditional disclosure of secret protocols. The currently most interesting case $t=2$ can be based on the Boneh-Goh-Nissim cryptosystem. We use the new protocols to reduce the communication of virtually any existing oblivious transfer protocols by proposing a new communication-efficient generic transformation from computationally-private information retrieval protocols to oblivious transfer protocols.

Type:Report
Title:New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
Keywords:Computationally-private information retrieval, conditional disclosure of secrets, oblivious transfer
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Adastral Park

Archive Staff Only: edit this record