[Resource Topic] 2007/133: New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

Welcome to the resource topic for 2007/133

New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

Authors: Helger Lipmaa


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.

ePrint: https://eprint.iacr.org/2007/133

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .