Some improved bounds on the information rate of perfect secret sharing schemes
Journal of Cryptology
An explication of secret sharing schemes
Designs, Codes and Cryptography
On the information rate of perfect secret sharing schemes
Designs, Codes and Cryptography
Perfect Secret Sharing Schemes on Five Participants
Designs, Codes and Cryptography
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
Weighted threshold secret sharing schemes
Information Processing Letters
Communications of the ACM
New General Lower Bounds on the Information Rate of Secret Sharing Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Threshold cryptography based on Asmuth-Bloom secret sharing
Information Sciences: an International Journal
New efficient and practical verifiable multi-secret sharing schemes
Information Sciences: an International Journal
A probability model for reconstructing secret sharing under the internet environment
Information Sciences: an International Journal
An impossibility result on graph secret sharing
Designs, Codes and Cryptography
Strong (n,t,n) verifiable secret sharing scheme
Information Sciences: an International Journal
Space efficient secret sharing for implicit data security
Information Sciences: an International Journal
An ideal multi-secret sharing scheme based on MSP
Information Sciences: an International Journal
Probabilistic visual secret sharing schemes for grey-scale images and color images
Information Sciences: an International Journal
Meaningful secret sharing technique with authentication and remedy abilities
Information Sciences: an International Journal
Visual multiple secret sharing based upon turning and flipping
Information Sciences: an International Journal
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Secret sharing schemes with bipartite access structure
IEEE Transactions on Information Theory
Decomposition constructions for secret-sharing schemes
IEEE Transactions on Information Theory
New bounds on the information rate of secret sharing schemes
IEEE Transactions on Information Theory
| Hi-index | 0.07 |
A secret-sharing scheme is a protocol by which a dealer distributes shares of a secret key among a set of n participants in such a way that only qualified subsets of participants can reconstruct the secret key from the shares they received, while unqualified subsets have no information about the secret key. The collection of all qualified subsets is called the access structure of this scheme. The information rate (resp. average information rate) of a secret-sharing scheme is the ratio between the size of the secret key and the maximum size (resp. average size) of the shares. In a weighted threshold scheme, each participant has his or her own weight. A subset is qualified if and only if the sum of the weights of participants in the subset is not less than the given threshold. Morillo et al. [19] considered the schemes for weighted threshold access structure that can be represented by graphs called k-weighted graphs. They characterized this kind of access structures and derived a result on the information rate. In this paper, we deal with the average information rate of the secret-sharing schemes for these structures. Two sophisticated constructions are presented, each of which has its own advantages and both of them perform very well when n/k is large.