New Communication-Efficient Oblivious Transfer Protocols Based on Pairings.
Helger Lipmaa
Abstract
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 + ⌈n/t ⌉ and 3 + ⌈n/(t + 1) ⌉ 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 communicationefficient generic transformation from computationally-private information retrieval protocols to oblivious transfer protocols. Keywords. Computationally-private information retrieval, conditional disclosure of secrets, homomorphic encryption, oblivious transfer. 1