On Distributed Oblivious Transfer
Serdica Journal of Computing, Tome 1 (2007) no. 3, pp. 313-336
This paper is about unconditionally secure distributed protocols
for oblivious transfer, as proposed by Naor and Pinkas and generalized by
Blundo et al. In this setting a Sender has ζ secrets and a Receiver is
interested in one of them. The Sender distributes the information about
the secrets to n servers, and a Receiver must contact a threshold of the
servers in order to compute the secret. We present a non-existence result
and a lower bound for the existence of one-round, threshold, distributed
oblivious transfer protocols, generalizing the results of Blundo et al. A
threshold based construction implementing 1-out-of-ζ distributed oblivious
transfer achieving this lower bound is described. A condition for existence
of distributed oblivious transfer schemes based on general access structures
is proven. We also present a general access structure protocol implementing
1-out-of-ζ distributed oblivious transfer.
Keywords:
Cryptographic Protocols, Oblivious Transfer
@article{SJC_2007_1_3_a6,
author = {Nikov, Ventzislav and Nikova, Svetla and Preneel, Bart},
title = {On {Distributed} {Oblivious} {Transfer}},
journal = {Serdica Journal of Computing},
pages = {313--336},
year = {2007},
volume = {1},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SJC_2007_1_3_a6/}
}
Nikov, Ventzislav; Nikova, Svetla; Preneel, Bart. On Distributed Oblivious Transfer. Serdica Journal of Computing, Tome 1 (2007) no. 3, pp. 313-336. http://geodesic.mathdoc.fr/item/SJC_2007_1_3_a6/