secretutil

Contains all the auxillary functions to do linear secret sharing (LSS) over an access structure. Mainly, we represent the access structure as a binary tree. This could also support matrices for representing access structures.

class secretutil.SecretUtil(groupObj, verbose=True)

Bases: object

P(coeff, x)

calculateSharesDict(secret, tree)

calculate shares from given secret and returns a dict as {attribute:shares} pairs

calculateSharesList(secret, tree)

calculate shares from given secret and returns a list of shares.

createPolicy(policy_string)

genShares(secret, k, n)

getAttributeList(Node)

getCoefficients(tree)

prune(policy, attributes)

determine whether a given set of attributes satisfies the policy

recoverCoefficients(list)

recovers the coefficients over a binary tree.

recoverSecret(shares)

take shares and attempt to recover secret by taking sum of coeff * share for all shares. if user indeed has at least k of n shares, then secret will be recovered.

strip_index(node_str)