On Unconditionally Secure Distributed Oblivious Transfer


This paper is about the oblivious transfer in the distributed model proposed by Naor and 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 informationabout the secrets to m Servers. Afterwards, in a recovering phase, the Receiver can compute the secret she wishes by… (More)
DOI: 10.1007/s00145-007-0327-2


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.