Skip to main content
Cryptography

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • $\begingroup$ possible duplicate of Protocol for Randomized Oblivious Transfer? $\endgroup$ Commented Jan 25, 2014 at 19:34
  • 1
    $\begingroup$ Nope; the solution listed as a duplicate doesn't meet the criteria; Alice sends back two bits, not just one... $\endgroup$ Commented Jan 25, 2014 at 20:12
  • $\begingroup$ @poncho If the solution listed as a duplicate doesn't meet the criteria, why leave the close vote? Is it a duplicate nevertheless? Maybe I'm confused because it's late (2AM) and I could imagine there's an obvious reason, but somehow I'm not getting it... probably due to the "Nope" which contradicts the "dupe" vote. $\endgroup$ Commented Jan 26, 2014 at 1:01
  • $\begingroup$ I am finding this question hard to follow. What do you mean by a "transfer method"? What is $Sc$? Do you mean $s_c$? What counts as bits transferred to Bob? Can they invoke $F$ as many times as they want? Who provides the inputs to $F$ (does $x$ come from Alice and $y$ from Bob)? Are we guaranteed that $p,q$ are chosen randomly subject to the condition that $p \oplus q = x \times y$? Please edit the question to make the problem statement clearer. $\endgroup$ Commented Jun 23, 2014 at 1:37