On unconditionally secure distributed oblivious transfer

DOI10.1007/S00145-007-0327-2MaRDI QIDQ2642256zbMATH OpenOpenAlexFDO

Authors Carlo Blundo, Paolo D'Arco, Alfredo De Santis, D. R. Stinson

Publication date 20 August 2007

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-007-0327-2

zbMATH Keywords

distributed cryptography lower bound oblivious transfer secret sharing

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Review text

An analysis and new results for 1-out-of-\(n\) distributed oblivious transfer are presented. In the setting considered the sender holds \(n\) secrets, the receiver is interested in one of them, and the sender delegates \(m\) Servers to accomplish the 1-out-of-\(n\) oblivious transfer. The crucial security requirement is that the receiver after interaction with any \(k\) of servers recovers just one secret but gets no information on the others, and on the other side any coalition of \(k-1\) servers cannot compute any secret nor to determine which secret receiver has recovered. The basic framework are unconditionally secure distributed oblivious transfer protocols. The paper presents lower bounds on the resources required to implement such protocols, some impossibility results for one-round schemes, and new constructions which are optimal with respect to some of the given bounds.

Recommendations

Cited in

(13)

This page was built for publication: On unconditionally secure distributed oblivious transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642256)