This work is about distributed protocols for oblivious transfer, proposed by Naor and Pinkas, and recently generalized by Blundo et. al. In this settings a Sender has n secrets and a Receiver is interested in one of them. The Sender distributes the information about the secrets to m servers, and a Receiver must contact a threshold of the servers in order to compute the secret. These distributed oblivious transfer protocols provide information theoretic security. We present impossibility result and lower bound for existence of one-round threshold distributed oblivious transfer protocols, generalizing the results of Blundo et. al. A threshold based construction implementing 1-out-of-n distributed oblivious transfer achieving the proved lower bound for existence is proposed. A condition for existence of general access structure distributed oblivious transfer scheme is proven.We also present a general access structure protocol implementing 1-out-of-n distributed oblivious transfer.
CITATION STYLE
Nikov, V., Nikova, S., Preneel, B., & Vandewalle, J. (2002). On unconditionally secure distributed oblivious transfer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2551, pp. 395–408). Springer Verlag. https://doi.org/10.1007/3-540-36231-2_31
Mendeley helps you to discover research relevant for your work.