Efficient Reduction of 1 out of N Oblivious Transfers in Random Oracle Model

We first present a protocol which reduces 1-of-n oblivious transfer OT m for n > 2 in random oracle model, and show that the protocol is secure against malicious sender and semi-honest receiver. Then, by employing a cut-and-choose technique, we obtain a variant of the basic protocol which is secure against a malicious receiver