Crate adss

The adss crate defines functionality for performing secret sharing with established security guarantees. We use this framework as it allows for specifying the random coins that are used for establishing the lagrange polynomial coefficients explicitly. A description of the framework is provided in the paper by Bellare et al..

Structs

• AccessStructure
  The AccessStructure struct defines the policy under which shares can be recovered. Currently, this policy is simply whether there are threshold number of independent shares.
• Commune
  A Commune is a unique instance of sharing across multiple parties
• Share
  The Share struct holds the necessary data that is encoded in a single secret share. A share itself reveals nothing about the encoded secret data until it is grouped with a set of shares that satisfy the policy in the associated AccessStructure.

Constants

• ACCESS_STRUCTURE_LENGTH
• MAC_LENGTH

Functions

• load_bytes
• load_u32
• recover
  The recover function attempts to recover a secret shared value from a set of shares that meet the threshold requirements.
• store_bytes
• store_u32