Efficient oblivious transfer from any non-trivial binary-symmetric channel
Douglas Stebila, Stefan Wolf · 2003
In 1997, Crepeau proved that the important cryptographic primitive of oblivious transfer can be efficiently realized by using a binary-symmetric channel with symbol-error probability less than 0.1982. We show that this restriction is unnecessary: Oblivious transfer can be realized as efficiently based on any non-trivial binary-symmetric channel between the involved parties.