## CryptoDB

### Hongda Li

#### Publications

Year
Venue
Title
2014
EPRINT
2005
EPRINT
We first present a protocol which reduces 1-out-of-$n$ oblivious transfer OT$_l^m$ to 1-out-of-$n$ oblivious transfer OT$_m^k$ for $n>2$ in random oracle model, and show that the protocol is secure against malicious sender and semi-honest receiver. Then, by employing a cut-and-choose technique, we obtain a variant of the basic protocol which is secure against a malicious receiver.

Bao Li (1)
Bei Liang (1)
Qihua Niu (1)
Fei Tang (1)
Guangwu Xu (1)
Haixia Xu (1)