Join Log in
Score:0
rzxh avatar Crypto

Communication cost of bit level calculation for boolean shares in MPC

de flag
rzxh

Bit operations, such as bit addition/multiplication, are quite efficient from computation point of view. But in MPC, for example, if we use beaver triples for bit multiplication, 2 parties have to exchange intermediate values which leads to network communication. So, although the meaningful data we exchange is not that much (1 bit from each direction), are we consuming too much extra costs (network latency + sending time of a package with ONLY 1 bit useful payload but much bigger header) for this simple bit multiplication IN PRACTICAL?

32
0 + 0
Geoffroy Couteau avatar
cn flag
Geoffroy Couteau
Note that secure multiplications are usually not executed sequentially: instead, all multiplication gates with the same multiplicative depth in the circuit are executed in parallel. For typical circuits, this strongly amortizes the cost of headers and latency issues (though latency is still a problem - that's why, in the LAN setting, solutions based on garbled circuits are sometimes preferred).
1
Reply
ธงชาติไทย
Elon Musk
I sit in a Tesla and translated this thread with Ai:

mangohost

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.