Multi-linear Secret-Sharing Schemes. Conference Paper uri icon


  • Abstract. Multi-linear secret-sharing schemes are the most common secret-sharing schemes. In these schemes the secret is composed of some field elements and the sharing is done by applying some fixed linear mapping on the field elements of the secret and some randomly chosen field elements. If the secret contains one field element, then the scheme is called linear. The importance of multi-linear schemes is that they provide a simple non-interactive mechanism for computing shares of linear combinations of previously shared secrets …

publication date

  • February 3, 2014

presented at event

  • TCC  Conference