sss

README

Secret Sharing Schema

The main problem with known secret-sharing schemes is the large share size: it is exponential in the number of parties

Introduction

Secret-sharing schemes are a tool used in many cryptographic protocols. A secret-sharing scheme involves a dealer who has a secret, a set of n parties, and a collection A of subsets of parties called the access structure.

Originally motivated by the problem of secure information storage, secret-sharing schemes have found numerous other applications in cryptography and distributed computing, e.g., Byzantine agreement, secure multiparty computations, threshold cryptography, access control, attribute-based encryption, and generalized oblivious transfer.

Documentation

Index

• func ShareAdd(a common.Shareable, b common.Shareable) (common.Shareable, error)
• func ShareDivision(a common.Shareable, b common.Shareable) (common.Shareable, error)
• func ShareMul(a common.Shareable, b int) (common.Shareable, error)
• func ShareNegation(a common.Shareable) (common.Shareable, error)
• func SharePow(a common.Shareable, b int) (common.Shareable, error)
• func ShareSubstraction(a common.Shareable, b common.Shareable) (common.Shareable, error)

Functions

func ShareAdd

func ShareAdd(a common.Shareable, b common.Shareable) (common.Shareable, error)

func ShareDivision

func ShareDivision(a common.Shareable, b common.Shareable) (common.Shareable, error)

func ShareMul

func ShareMul(a common.Shareable, b int) (common.Shareable, error)

func ShareNegation

func ShareNegation(a common.Shareable) (common.Shareable, error)

func SharePow

func SharePow(a common.Shareable, b int) (common.Shareable, error)

func ShareSubstraction

func ShareSubstraction(a common.Shareable, b common.Shareable) (common.Shareable, error)