Paper 2017/235

Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption

Isheeta Nargis

Abstract

In this article, a new oblivious transfer (OT) protocol, secure in the presence of erasure-free one-sided active adaptive adversaries is presented. The new bit OT protocol achieves better communication complexity than the existing bit OT protocol in this setting. The new bit OT protocol requires fewer number of public key encryption operations than the existing bit OT protocol in this setting. As a building block, a new two-party lossy threshold homomorphic public key cryptosystem is designed. It is secure in the same adversary model. It is of independent interest.

Note: The affiliation text corrected.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Major revision. AFRICACRYPT 2017 (Accepted)
Keywords
Oblivious transferActive adversaryOne-sided adaptive adversaryThreshold encryptionLossy encryptionPublic key encryptionHomomorphic encryption
Contact author(s)
inargis @ ucalgary ca
History
2017-03-12: revised
2017-03-11: received
See all versions
Short URL
https://ia.cr/2017/235
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/235,
      author = {Isheeta Nargis},
      title = {Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2017/235},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/235}},
      url = {https://eprint.iacr.org/2017/235}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.