Oblivious transfer (OT) protocols mainly contain three categories: 1-out-of-2 OT, 1-out-of-n OT, and k-out-of-n OT. In most\r\ncases, they are treated as cryptographic primitives and are usually executed without consideration of possible attacks that might\r\nfrequently occur in an open network, such as an impersonation, replaying, or man-in-the-middle attack. Therefore, when used in\r\ncertain applications, such as mental poker games and fair contract signings, some extra mechanisms must be combined to ensure\r\nthe security of the protocol. However, after a combination, we found that very few of the resulting schemes are efficient enough in\r\nterms of communicational cost, which is a significant concern for generic commercial transactions. Therefore, we propose a novel\r\nk-out-of-n oblivious transfer protocol based on bilinear pairing, which not only satisfies the requirements of a k-out-of-n OT\r\nprotocol, but also provides mutual authentication to resist malicious attacks. Meanwhile, it is efficient in terms of communication\r\ncost.
Loading....