Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
Requirements for Group Independent Linear Threshold Secret Sharing Schemes
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Sharing one secret vs. sharing many secrets
Theoretical Computer Science - Mathematical foundations of computer science
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
An information theoretical model for quantum secret sharing
Quantum Information & Computation
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Information Sciences: an International Journal
| Hi-index | 754.84 |
´A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. We derive new limitations on the information rate of secret sharing schemes, that measures how much information is being distributed as shares as compared to the size of the secret key, and the average information rate, that is the ratio between the secret size and the arithmetic mean of the size of the shares. By applying the substitution technique, we are able to construct many new examples of access structures where the information rate is bounded away from 1. The substitution technique is a method used to obtain a new access structure by replacing a participant in a previous structure with a new access structure