Robust non-interactive t-out-of-n oblivious transfer based on the RSA cryptosystem

Abstract

In 2003, Mu et al. proposed a non-interactive oblivious transfer scheme based on the standard ElGamal encryption scheme. Unfortunately, the receiver cannot verify the retrieved messages in the original scheme. Though they also proposed an extension to amend this drawback, this extension makes itself impracticable. On the other hand, the RSA cryptosystem is widely spread, and the certification infrastructure for it has been well built. As a result, we present two efficient non-interactive t-out-of-n oblivious transfer schemes in this paper, where one is for the honest receiver and the other is to inhibit the dishonest user from getting the valid signature of the sender. Moreover, the receiver can easily verify the requested messages in our schemes.