Title: On Unconditionally Secure Distributed Oblivious Transfer
Authors: Nikov, V ×
Nikova, Svetla
Preneel, Bart
Vandewalle, Joos #
Issue Date: 2002
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:2551 pages:395-408
Conference: INDOCRYPT 2002 date:December 16-18, 2002
Abstract: 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.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
article-190.pdf Published 216KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science