Efficient t-out-of-n Oblivious Transfer Schemes

In this paper, we shall bring up two efficient t-out-of-n oblivious transfer schemes. The first comes out handy for communication and computation. However, it has a shortcoming in revealing combined information of secrets. To solve this problem, we have developed it into the second scheme.

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

[2]  Yi-Shiung Yeh,et al.  Randomization enhanced Chaum's blind signature scheme , 2000, Comput. Commun..

[3]  Wen-Guey Tzeng.  Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters , 2004, IEEE Transactions on Computers.

[4]  Lein Harn,et al.  Noninteractive oblivious transfer , 1990 .

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

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

[7]  Sampath Kannan,et al.  The relationship between public key encryption and oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Yi Mu,et al.  Robust non-interactive oblivious transfer , 2003, IEEE Communications Letters.

[9]  Bert den Boer.  Oblivous Transfer Protecting Secrecy , 1991, EUROCRYPT.