Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment

In this paper, we have discussed the issues concerning the basic concept and classification of OT (Oblivious Transfer). We have proposed secure verifiable non-interactive oblivious transfer protocols for the exchange of secrets on distributed environments. One is a new secure verifiable non-interactive oblivious transfer protocol using RSA, the other is that with bit commitment using one-way functions. The structure of the protocols is similar to that of the original protocols proposed by Bellare and Micali. Their protocols are based on the difficulty of the discrete logarithm problem. Our protocols are also based on the difficulty of the discrete logarithm problem. The secret in their protocol could be chosen as a random number. The security in our protocols also can be chosen as a random number. These methods have the additional functions that enable us to authenticate the sender and to protect one's denial of what he/she has sent the messages to the other. The traffic amount of transfer of the proposed methods is less than or equal to that of the conventional interactive method.