1
$\begingroup$

Do we have information theoretic oblivious transfer protocols that are that can not be broken by a computationally unbounded attacker?

|improve this question
$\endgroup$
  • $\begingroup$ An Oblivious Transfer Protocol that can not be broken by a computationally unbounded attacker. $\endgroup$ – Severus Nov 3 '19 at 20:13
4
$\begingroup$

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.

|improve this answer
$\endgroup$
  • $\begingroup$ Thanks! Could you answer this please - crypto.stackexchange.com/questions/75212/…? $\endgroup$ – Severus Nov 4 '19 at 8:41
  • $\begingroup$ Occasionally one will see papers that highlight the fact that OT can be obtained from different kinds of noisy channels. In light of that, it might make sense to consider "OT from physical assumptions" as a form of information-theoretic or unconditional OT. $\endgroup$ – Mikero Nov 4 '19 at 17:19

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.