Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption

Isheeta Nargis

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 transfer Active adversary One-sided adaptive adversary Threshold encryption Lossy encryption Public key encryption Homomorphic 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: 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},
      url = {https://eprint.iacr.org/2017/235}
}