Analysis of an Unconditionally Secure Distributed Oblivious Transfer

In the Journal of Cryptology (20(3):323–373, 2007), Blundo, D’Arco, De Santis and Stinson proposed a general model for unconditionally secure distributed oblivious transfer (DOT), where a sender has n secrets and a receiver is interested to one of them. We show that their “t-private weak one-round (k,m)-DOT $binom{n}{1}$ ” protocol cannot prevent a receiver who attempts to obtain more than one secret. We present a modification to Blundo et al.’s protocol that fixes this problem.