Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A Class of Nonbinary Codes and Sequence Families
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Properties and applications of preimage distributions of perfect nonlinear functions
IEEE Transactions on Information Theory
On the covering structures of two classes of linear codes from perfect nonlinear functions
IEEE Transactions on Information Theory
Secret sharing schemes from binary linear codes
Information Sciences: an International Journal
A note of perfect nonlinear functions
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
The weight distribution of a class of p-ary cyclic codes
Finite Fields and Their Applications
Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the relationships between perfect nonlinear functions and universal hash families
Theoretical Computer Science
| Hi-index | 754.96 |
In this paper, error-correcting codes from perfect nonlinear mappings are constructed, and then employed to construct secret sharing schemes. The error-correcting codes obtained in this paper are very good in general, and many of them are optimal or almost optimal. The secret sharing schemes obtained in this paper have two types of access structures. The first type is democratic in the sense that every participant is involved in the same number of minimal-access sets. In the second type of access structures, there are a few dictators who are in every minimal access set, while each of the remaining participants is in the same number of minimal-access sets.