On Distributed Oblivious Transfer

Nikov, Ventzislav, Nikova, Svetla, and Preneel, Bart. "On Distributed Oblivious Transfer." Serdica Journal of Computing 1.3 (2007): 313-336. <http://eudml.org/doc/11428>.

@article{Nikov2007,
abstract = {The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at INDOCRYPT 2002This 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.},
author = {Nikov, Ventzislav, Nikova, Svetla, Preneel, Bart},
journal = {Serdica Journal of Computing},
keywords = {Cryptographic Protocols; Oblivious Transfer},
language = {eng},
number = {3},
pages = {313-336},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {On Distributed Oblivious Transfer},
url = {http://eudml.org/doc/11428},
volume = {1},
year = {2007},
}

TY - JOUR
AU - Nikov, Ventzislav
AU - Nikova, Svetla
AU - Preneel, Bart
TI - On Distributed Oblivious Transfer
JO - Serdica Journal of Computing
PY - 2007
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 1
IS - 3
SP - 313
EP - 336
AB - The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at INDOCRYPT 2002This 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.
LA - eng
KW - Cryptographic Protocols; Oblivious Transfer
UR - http://eudml.org/doc/11428
ER -