Most efficient way to implement a 1-out-of-4 OT for GMW?

qmango

10/29/23, 5:45 AM

Assuming evaluation in the online phase (no beaver triple/offline method used), each AND gate in GMW must be evaluated using a 1-out-of-4 OT. I've seen some sources (here, and here) say this can be implemented using 3 1-out-of-2 OTs over 1 bit strings. Can it also be implemented from 2 1-out-of-2 OTs over 1 bit strings? (Assuming we can treat the 1-out-of-2 OT as a black box).

(Note: I know this question says that a 1-out-of-n OT can be implemented from log(n) 1-out-of-2 OTs, but that seemed to only be for k-bit strings for a security parameter k.)

0 + 0

oblivious-transfer

multiparty-computation

Elon Musk

I sit in a Tesla and translated this thread with Ai:

EN: Most efficient way to implement a 1-out-of-4 OT for GMW?

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.