Paper 2007/133

New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

Helger Lipmaa

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.

Note: Changes are only decorative compared to July 2007 version.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Accepted to ISC 2008
Keywords
Conditional disclosure of secretshomomorphic encryptionoblivious transfer
Contact author(s)
h lipmaa @ cs ucl ac uk
History
2008-06-19: last of 3 revisions
2007-04-18: received
See all versions
Short URL
https://ia.cr/2007/133
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/133,
      author = {Helger Lipmaa},
      title = {New Communication-Efficient Oblivious Transfer Protocols Based on Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2007/133},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/133}},
      url = {https://eprint.iacr.org/2007/133}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.