Score:0

A single array access with multiplexers to achieve obliviousness

bb flag

I'm new to secure multi-party computation and ORAM. My question is quite simple.

Is there a concrete example to explain the linear scan for an array with multiplexers to achieve obliviousness?

I didn't find any good examples to explain this.

Additionally, in a linear scan, each access of an n-element array requires a circuit of Θ(n) size where the entire array is multiplexed for the required element by the index being accessed (As introduced in "A Pragmatic Introduction to Secure Multi-Party Computation").

Can't we do this with multiplexers in parallel to improve efficiency? That is, assuming we have an array of length N, we assign N threads to process each multiplexer. Is the final runtime reduced (although it doesn't affect the communication cost)?

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.