Do we have information theoretic oblivious transfer protocols that are that can not be broken by a computationally unbounded attacker?
$\begingroup$
$\endgroup$
1
-
$\begingroup$ An Oblivious Transfer Protocol that can not be broken by a computationally unbounded attacker. $\endgroup$– SeverusNov 3, 2019 at 20:13
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
3
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.
answered Nov 4, 2019 at 6:16
-
$\begingroup$ Thanks! Could you answer this please - crypto.stackexchange.com/questions/75212/…? $\endgroup$– SeverusNov 4, 2019 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$– MikeroNov 4, 2019 at 17:19
-
$\begingroup$ Are there resources available where I can learn more about these IT/computationally secure OT protocols? $\endgroup$ Oct 5, 2020 at 18:55