Institute of Information Theory and Automation

You are here

Multilinear Secret-Sharing Scheme

Date: 
2015-08-18 14:00
Room: 
Name of External Lecturer: 
Aner Moshe Ben Efraim
Affiliation of External Lecturer: 
Dept. of Computer Science, Ben Gurion University of the Negev, Be’er Sheva, Israel

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.

In this work we study the power of multi-linear secret-sharing schemes. On the one hand, we prove that ideal multi-linear secret-sharing schemes in which the secret is composed of p field elements are more powerful than schemes in which the secret is composed of less than p field elements (for every prime p). On the other hand, we prove super-polynomial lower bounds on the share size in multi-linear secret-sharing schemes.

kratochvil: 2015-08-11 07:59