How to Build Robust Shared Control Systems
Designs, Codes and Cryptography
Secret-sharing with a class of ternary codes
Theoretical Computer Science
Communications of the ACM
Variations on Minimal Codewords in Linear Codes
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The access structure of some secret-sharing schemes
ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
On the non-minimal codewords in binary Reed--Muller codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Threshold cryptography based on Asmuth-Bloom secret sharing
Information Sciences: an International Journal
A multiple-level visual secret-sharing scheme without image size expansion
Information Sciences: an International Journal
New efficient and practical verifiable multi-secret sharing schemes
Information Sciences: an International Journal
The weight distribution of some irreducible cyclic codes
IEEE Transactions on Information Theory
Covering and secret sharing with linear codes
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Minimal vectors in linear codes
IEEE Transactions on Information Theory
The weights of the orthogonals of the extended quadratic binary Goppa codes
IEEE Transactions on Information Theory
Linear codes from perfect nonlinear mappings and their secret sharing schemes
IEEE Transactions on Information Theory
Secret sharing schemes from three classes of linear codes
IEEE Transactions on Information Theory
Space efficient secret sharing for implicit data security
Information Sciences: an International Journal
New code equivalence based on relative generalized Hamming weights
Information Sciences: an International Journal
Further results on support weights of certain subcodes
Designs, Codes and Cryptography
| Hi-index | 0.07 |
In principle, every linear code can be used to construct a secret sharing scheme. However, in general, determining the access structure of the scheme is very hard. On the other hand, finding error correcting codes that produce secret sharing schemes with efficient access structures is also difficult. In this paper, we study a set of minimal codewords for certain classes of binary linear codes, and then determine the access structure of secret sharing schemes based on these codes. Furthermore, we prove that the secret sharing schemes obtained are democratic in the sense that every participant is involved in the same number of minimal access sets.