A Novel k-out-of-n Oblivious Transfer Protocol from Bilinear Pairing.pdfVIP

Hindawi Publishing Corporation Advances in Multimedia Volume 2012, Article ID 630610, 9 pages doi:10.1155/2012/630610 Research Article A Novel k -out-of-n Oblivious Transfer Protocol from Bilinear Pairing Jue-Sam Chou Department of Information Management, Nanhua University, No. 55, Section 1, Nanhua Road, Dalin Township, Chiayi County 62249, Taiwan Correspondence should be addressed to Jue-Sam Chou, jschou@.tw Received 30 November 2011; Revised 13 March 2012; Accepted 27 March 2012 Academic Editor: Mohamed Hamdi Copyright © 2012 Jue-Sam Chou. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 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 cases, they are treated as cryptographic primitives and are usually executed without consideration of possible attacks that might frequently occur in an open network, such as an impersonation, replaying, or man-in-the-middle attack. Therefore, when used in certain applications, such as mental poker games and fair contract signings, some extra mechanisms must be combined to ensure the security of the protocol. However, after a combination, we found that very few of the resulting schemes are efficient enough in terms of communicational cost, which is a significant concern for generic commercial transactions. Therefore, we propose a novel k-out-of-n oblivious transfer protocol based on bilinear pairing, which not only satisfies the requirements of a k-out-of-n OT protocol, but also provides mutual authentication to resist malicious attacks. Meanwhile, it is efficient in terms of communication cost.