Cryptology ePrint Archive: Report 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.

Category / Keywords: Oblivious transfer, Active adversary, One-sided adaptive adversary, Threshold encryption, Lossy encryption, Public key encryption, Homomorphic encryption

Original Publication (with major differences): AFRICACRYPT 2017 (Accepted)

Date: received 8 Mar 2017, last revised 12 Mar 2017

Contact author: inargis at ucalgary ca

Available format(s): PDF | BibTeX Citation

Note: The affiliation text corrected.

Version: 20170312:195259 (All versions of this report)

Short URL: ia.cr/2017/235

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]