Abstract. This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of these servers in order to run the oblivious transfer protocol. These distributed oblivious transfer protocols provide information theoretic security, and do not require the parties to compute exponentiations or any other kind of public key operations. Consequently, the protocols are very efficient computationally.
Naor and Pinkas REF introduce distributed oblivious transfer which distributes the task of the database among multiple servers to compute the standard oblivious transfer functionality.
Distributed oblivious transfer
In Proc. ASIACRYPT 2000
Computer Science