Score:5

Shamir secret sharing where some specific people are required to participate

ru flag

By using SSSS we distribute the key to "N" people where any "k" (N>=k) are required to participate to unlock the code. But what if I wish to have the people "x" and "y" always be part of "k".

Any provisions for that??

Score:8
ru flag

It's very straightforward. You divide your secret into three random shares $s=s_x\oplus s_y\oplus s_z$. Now divide $s_z$ into $N-2$ shares using SSSS and pass these to the non-special participants while passing $s_x$ and $s_y$ to $x$ and $y$ respectively.

This can be thought of as a generalisation of a scheme where multiple groups share the secret among them and a certain level of representation is required from each group. The scheme consist of splitting $s$ into $g$ parts where $g$ is the number of groups and then using SSSS on each of the parts.

This in turn can be thought of as a generalisation of an "electoral college" version of SSSS where a minimum threshold of groups/constituencies must participate and a minimum threshold of users is required for each group/constituency to participate. Split the master secret into as many shares as there are constituencies using SSSS, then divide each of the constituency shares into user shares again using SSSS.

Further iterations and variations are of course possible and it should be clear how to orchestrate them.

Chygo Runner avatar
ru flag
Thank you so much
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.