Editing Secret sharing (section)

=== 1 < ''t'' < ''n'' ===
The difficulty{{clarify|is this a major "difficulty" that's still unresolved? If not, then why to mention it at all?|date=April 2023}} lies in creating schemes that are still secure, but do not require all ''n'' shares.

When space efficiency is not a concern, trivial {{nowrap|1=''t'' = ''n''}} schemes can be used to reveal a secret to any desired subsets of the players simply by applying the scheme for each subset. For example, to reveal a secret ''s'' to any two of the three players Alice, Bob and Carol, create three (<math>\binom{3}{2}</math>) different {{nowrap|1=''t'' = ''n'' = 2}} secret shares for ''s'', giving the three sets of two shares to Alice and Bob, Alice and Carol, and Bob and Carol.