1
$\begingroup$

Is there a secret sharing scheme where secrets can be weighted, and that you need a total weight of $1$ to unlock the secret?

I know that you could, of course, just figure out every subset that has access to the secret and then do a XOR secret sharing scheme, but that isn't very efficient.

$\endgroup$
1
  • $\begingroup$ @RickyDemer I'm considering the general case, where this may not be the case. $\endgroup$ Feb 13, 2016 at 20:29

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.