New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

  • Authors:
  • Helger Lipmaa

  • Affiliations:
  • University College London, UK

  • Venue:
  • ISC '08 Proceedings of the 11th international conference on Information Security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We construct two simple families of two-message (n,1)-oblivious transfer protocols based on degree-thomomorphic 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. 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.