Secret sharing schemes on access structures with intersection number equal to one |
| |
Authors: | Jaume Martí-Farré |
| |
Institution: | Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona, 1-3, Mòdul C3, Campus Nord, 08034 Barcelona, Spain |
| |
Abstract: | The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied in this paper for access structures with intersection number equal to one, that is, structures such that there is at most one participant in the intersection of any two different minimal qualified subsets. The main result in this work is the complete characterization of the ideal access structures with intersection number equal to one. In addition, bounds on the optimal information rate are provided for the non-ideal case. |
| |
Keywords: | Cryptography Secret sharing schemes Information rate Ideal schemes |
本文献已被 ScienceDirect 等数据库收录! |
|