Provided by: Shanghai UEAC Exhibition Services Co., Ltd.
In 2007, in this paper the researchers proposed an adaptive Oblivious Transfer (OT) in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other. In this paper, the authors show that the scheme has a drawback that the sender can only serve a single receiver only once. The drawback results from the deterministic encryption used. To fix it, they suggest to replace the deterministic encryption with a probabilistic encryption.