Score:0

Correcting threshold in multi-party computation

cn flag

I am currently reading the paper Graceful Degradation in Multi-Party Computation. The paper mentioned something about correct structure, denoted C = {C1, . . . , Cl}.

On page 10 the paper reads:

Then, if the inconsistencies can be explained with a faulty set C ∈ C, the values from parties in C are ignored.

I am confused about what that could mean.

Maarten Bodewes avatar
in flag
I've changed your text to make this one concise question.
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.