|
|||||
|
|
The optimal linear secret sharing scheme for any given access structure |
|
| Authors: | Chunming Tang Shuhong Gao Chengli Zhang |
| Institution: | 1. School of Mathematics and Information Science, Guangzhou University, Guangzhou, 510006, China 2. Key Laboratory of Mathematics and Interdisciplinary Sciences of Guangdong Higher Education Institutes, Guangzhou University, Guangzhou, 510006, China 3. Department of Mathematical Sciences, Clemson University, Clemson, 29634, USA |
| Abstract: | Any linear code can be used to construct a linear secret sharing scheme. In this paper, it is shown how to decide optimal linear codes (i.e., with the biggest information rate) realizing a given access structure over finite fields. It amounts to solving a system of quadratic equations constructed from the given access structure and the corresponding adversary structure. The system becomes a linear system for binary codes. An algorithm is also given for finding the adversary structure for any given access structure. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |