Efficient Post Quantum Random Oblivious Transfer Based on Lattice

The large scale multiparty computation and private set intersection requires a number of oblivious transfer instances as subroutines, but the implementation of oblivious transfer protocols is relatively slow. An feasible way is to use the oblivious transfer variant called random oblivious transfer. In this paper, we propose a 1-out-of-2 random oblivious transfer protocol and extend it to a 1-out-of-k random oblivious transfer protocol based on the LWE assumption, quantum computation and measurement. Then, we analysis the stand-alone security of our 1-out-of-2 random oblivious transfer protocol under various malicious situations and prove its universally composable security in UC framework. As for the security of our 1-out-of-k random oblivious transfer protocol, the similar results can be obtained.