Oblivious Transfer
Oblivious transfer and its correlations, as a setup for and a target of reductions between secure-computation primitives.
| Status | Statement | Tags |
|---|---|---|
|
Constant-Overhead AMD Circuits Polylogarithmic overhead in |C| and lambda is achieved by Genkin, Ishai and Weiss; constant overhead is open. The source’s Theorem 43 shows that achieving it would – together with the source’s own constant-overhead OT protocol – settle the main open question on constant-overhead secure computation for general Boolean circuits. 4 open |
Fault Tolerant CircuitsOblivious Transfercharacterization | |
|
Distance from Lines Modulo a Prime Numbered Conjecture 5.37 of the source, described there as a natural but apparently new number-theoretic conjecture whose study may be of independent interest. Nothing is proved about it; the source notes a deterministic variant might be easier to prove and is still useful. 5 open |
Oblivious Linear EvaluationOblivious Transferlower-bound |
No matching items