Sciweavers

Share
JOC
2007

On Unconditionally Secure Distributed Oblivious Transfer

10 years 12 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one of them. During a set up phase, the Sender gives information about the secrets to m Servers. Afterwards, in a recovering phase, the Receiver can compute the secret she wishes by interacting with any k of them. More precisely, from the answers received she computes the secret in which she is interested but she gets no information on the others and, at the same time, any coalition of k − 1 Servers can neither compute any secret nor figure out which one the Receiver has recovered. We present an analysis and new results holding for this model: lower bounds on the resources required to implement such a scheme (i.e., randomness, memory storage, communication complexity); some impossibility results for one-round distributed oblivious transfer protocols; two polynomial-based constructions implementing 1-out-of-n di...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JOC
Authors Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson
Comments (0)
books