View source: R/secret-sharing.R
| share_keys | R Documentation |
Produces the set of shares that party index would
distribute to the other parties under the chosen
sharing_scheme. The returned SecretShareMap is opaque;
in a real deployment the shares would be serialized and
routed over the network to each receiving party, and the
receiving parties would store them for use in an abort
recovery.
share_keys(cc, sk, n_parties, threshold, index, sharing_scheme = "additive")
cc |
A |
sk |
The |
n_parties |
Integer; total number of parties. |
threshold |
Integer; minimum number of shares needed to
reconstruct. For |
index |
Integer; the 1-based index of the party owning
|
sharing_scheme |
Character; either |
Two sharing schemes are supported:
"additive" — N-1 threshold; every party must contribute
their share to reconstruct. Robust against corruption of
any single party's storage but not against any party
dropping out.
"shamir" — floor(N/2) + 1 threshold; the secret can be
reconstructed from any majority subset of the distributed
shares. Robust against up to floor((N-1)/2) parties
dropping out.
A SecretShareMap suitable for passing to
recover_shared_key(). length() of it is the number of shares.
recover_shared_key()
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.