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

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.

[1]  Moni Naor,et al.  Efficient oblivious transfer protocols , 2001, SODA '01.

[2]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[3]  William Stallings,et al.  Cryptography and network security , 1998 .

[4]  Hossein Ghodosi.  On insecurity of Naor-Pinkas' distributed oblivious transfer , 2007, Inf. Process. Lett..

[5]  Yi Mu,et al.  m out of n Oblivious Transfer , 2002, ACISP.

[6]  Kaoru Kurosawa,et al.  Oblivious keyword search , 2004, J. Complex..

[7]  Geuk Lee,et al.  Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment , 2009, Future Gener. Comput. Syst..

[8]  Jue-Sam Chou,et al.  Mental poker game based on a bit commitment scheme through network , 2002, Comput. Networks.

[9]  Jing Qin,et al.  Non-interactive Oblivious Transfer Protocols , 2009, 2009 International Forum on Information Technology and Applications.

[10]  Wen-Guey Tzeng,et al.  Efficient k-out-of-n Oblivious Transfer Schemes , 2005, J. Univers. Comput. Sci..

[11]  Moni Naor,et al.  Privacy preserving auctions and mechanism design , 1999, EC '99.

[12]  Silvio Micali,et al.  Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.

[13]  Jianhong Zhang,et al.  Two provably secure k-out-of-n oblivious transfer schemes , 2005, Appl. Math. Comput..

[14]  Moni Naor,et al.  Distributed Oblivious Transfer , 2000, ASIACRYPT.

[15]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[16]  Chin-Chen Chang,et al.  Robust t-out-of-n oblivious transfer mechanism based on CRT , 2009, J. Netw. Comput. Appl..

[17]  Abhishek Parakh.  Oblivious Transfer Using Elliptic Curves , 2006 .

[18]  Chanathip Namprempre,et al.  The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme , 2002, Financial Cryptography.

[19]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[20]  Moni Naor,et al.  Oblivious Transfer with Adaptive Queries , 1999, CRYPTO.

[21]  Moni Naor,et al.  Oblivious transfer and polynomial evaluation , 1999, STOC '99.

[22]  Florian Kerschbaum,et al.  Privacy-preserving computation of benchmarks on item-level data using RFID , 2010, WiSec '10.

[23]  Hossein Ghodosi,et al.  Comments on the 'm out of n oblivious transfer' , 2006, Inf. Process. Lett..

[24]  Ya-Fen Chang,et al.  The Essential Design Principles of Verifiable Non-interactive OT Protocols , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[25]  Alexandra Boldyreva,et al.  Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .

[26]  Yael Tauman Kalai,et al.  Smooth Projective Hashing and Two-Message Oblivious Transfer , 2005, Journal of Cryptology.

[27]  Chin-Chen Chang,et al.  A new design for efficient t-out-n oblivious transfer scheme , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[28]  Silvio Micali,et al.  Non-Interactive Oblivious Transfer and Applications , 1989, CRYPTO.

[29]  Abhi Shelat,et al.  Simulatable Adaptive Oblivious Transfer , 2007, EUROCRYPT.

[30]  Fangguo Zhang,et al.  Oblivious transfer with timed-release receiver's privacy , 2011, J. Syst. Softw..

[31]  Matthew Green,et al.  Blind Identity-Based Encryption and Simulatable Oblivious Transfer , 2007, ASIACRYPT.

[32]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[33]  Gilles Brassard,et al.  All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.