Oblivious Transfer and Bit Commitment from Weak Primitives

In this paper we survey recent developments in the field of commitment and oblivious transfer based on weak primitives. We also present two original results: a commitment protocol that achieves non- zero rate from any non-trivial unfair binary symmetric channel; and an analysis of the information theoretical composability of oblivious transfer schemes based on two-party primitives.