4
$\begingroup$

In a traditional Oblivious Transfer setting, the sender has a list $(x_1, x_2, ... , x_n) \in G$ where $G$ is the chosen group. The receiver has $b \in \mathbb{N}$, such that engaging in the protocol the receiver is given $x_b$ and the sender does not learn $b$.

Presume I want a slightly different procedure, where the receiver gets a random $x_i$ and neither the sender nor receiver learn $i$.

Is there a name for protocols with this behavior?

$\endgroup$
3
$\begingroup$

The simplest way to do this would be to have the sender randomly shuffle the elements. The receiver chooses a random element to request. That way the receiver has no idea which of the original (before the shuffle) elements he got.

$\endgroup$
  • $\begingroup$ I am trying to use a network to do a distributed OT to a receiver. I don't want to use a secure shuffle protocol because I can not find one that is fault-tolerant. A great answer though. $\endgroup$ – Jason Knight Dec 25 '13 at 5:02

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.