Threshold Secret Sharing¶
Added in version 1.9.1.
Threshold secret sharing allows splitting a secret into N shares such that
M (for specified M <= N) is sufficient to recover the secret, but an
attacker with M - 1 shares cannot derive any information about the secret.
The implementation in Botan follows an expired Internet draft “draft-mcgrew-tss-03”. Several other implementations of this TSS format exist.
- Split a secret. The identifier is an optional key identifier which may be up to 16 bytes long. Shorter identifiers are padded with zeros. - The hash function must be either “SHA-1”, “SHA-256”, or “None” to disable the checksum. - This will return a vector of length - N, any- Mof these shares is sufficient to reconstruct the data.
 - Given a sufficient number of shares, reconstruct a secret. 
 - Read a TSS share as a sequence of bytes. 
 - Return the data of this share. 
 - Return the share ID which will be in the range 1…255