Homomorphic Encryption based k-out-of-n Oblivious Transfer Protocols

Oblivious Transfer (OT) is an important cryptographic tool, which has found its usage in many crypto protocols, such as Secure Multiparty Computations [9], Certified E-mail [2] and Simultaneous Contract Signing [20]. In this paper, we propose three k-out-of-n OT (OTnk ) protocols based on additive homomorphic encryption. Two of these protocols prohibit malicious behaviors from both sender and receiver. We also achieve efficient communication complexity bounded by O(l · n) in bits, where l is the size of the encryption key. The computational complexity is same or better than the most efficient existing protocols. Due to the semantic security property, the sender cannot get receiver’s selection. When the receiver tries to retrieve more than k values, the receiver is caught cheating with 1− 1/m probability (Protocol II) or the receiver is unable to get any value at all (Protocol III). We introduce a novel technique based on the solvability of linear equations, which could find its way into other applications. We also provide an experimental analysis to compare the efficiency of the protocols.

[1]  Martin Stanek,et al.  Efficient Simultaneous Contract Signing , 2004, SEC.

[2]  Wen-Guey Tzeng,et al.  Efficient 1-Out-n Oblivious Transfer Schemes , 2002, Public Key Cryptography.

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

[4]  Joe Kilian,et al.  Weakening Security Assumptions and Oblivious Transfer (Abstract) , 1988, CRYPTO.

[5]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[6]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[7]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[8]  Ivan Damgård,et al.  A generalization of Paillier’s public-key system with applications to electronic voting , 2010, International Journal of Information Security.

[9]  Gilles Brassard,et al.  Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Ali Miri,et al.  Optimal secure data retrieval using an oblivious transfer scheme , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[11]  Jacques Stern,et al.  A new public key cryptosystem based on higher residues , 1998, CCS '98.

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

[13]  Tatsuaki Okamoto,et al.  A New Public-Key Cryptosystem as Secure as Factoring , 1998, EUROCRYPT.

[14]  Oded Goldreich,et al.  Foundations of Cryptography: General Cryptographic Protocols , 2004 .

[15]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[16]  Claude Crépeau,et al.  Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.

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

[18]  Xiaofeng Chen,et al.  t-Out-of-n String/Bit Oblivious Transfers Revisited , 2005, ISPEC.

[19]  Hung-Min Sun,et al.  Towards Privacy Preserving Digital Rights Management Using Oblivious Transfer , 2006 .

[20]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

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