In the m-out-of-n oblivious transfer (OT) model, one party Alice sends n bits to another party Bob, Bob can get only m bits from the n bits. However, Alice cannot know which m bits Bob received. Y. Mu and Naor presented classical m-out-of-n oblivious transfer based on discrete logarithm. As the work of Shor, the discrete logarithm can be solved in… (More)