An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
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 sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
Efficient Sharing of Many Secrets
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An Optimal Multisecret Threshold Scheme Construction
Designs, Codes and Cryptography
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A threshold scheme is a system that protects a secret (key) among a group of participants in such a way that it can only be reconstructed from the joint information held by some predetermined number of these participants. In this paper we extend this problem to one where there is more than one secret that participants can reconstruct using the information that they hold. In particular we consider the situation where there is a secret sK associated with each k-subset K of participants and sK can be reconstructed by any group of t participants in K (t 驴 k). We establish bounds on the minimum amount of information that participants must hold in order to ensure that up to w participants (0 驴 w 驴 n - k + t - 1) cannot obtain any information about a secret with which they are not associated. We also discuss examples of systems that satisfy this bound.