Information Theoretic Oblivious Transfer? Do we have information theoretic oblivious transfer protocols that are that can not be broken by a computationally unbounded attacker?
It is impossible to achieve (fully) information theoretic oblivious transfer (OT), since OT is complete (and so can compute all functions). Since many (most) functions cannot be securely computed information theoretically with two parties, this means that it's impossible. Having said that, we do have OT protocols that provide information-theoretic security for a corrupted sender and computational security for a corrupted receiver, and other OT protocols that provide information-theoretic security for a corrupted receiver and computational security for a corrupted sender.