Because the t-out-of-n oblivious transfer (OT) protocol can guarantee the privacy of both participants, i.e., the sender and the receiver, it has been used extensively in the study of cryptography. Recently, Chang and Lee presented a robust t-out-of-n OT protocol based on the Chinese remainder theorem (CRT). In this paper, we use the Aryabhata remainder theorem (ART) to achieve the functionality of a t-out-of-n OT protocol, which is more efficient than Chang and Lee's mechanism. Analysis showed that our proposed protocol meets the fundamental requirements of a general t-out-of-n OT protocol. We also utilized BAN logic to prove that our proposed protocol maintains the security when messages are transmitted between the sender and the receiver.
Relation:
International Journal of Network Security, V.15 N.3: 212-218.
