An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
An explication of secret sharing schemes
Designs, Codes and Cryptography
Lower bounds for monotone span programs
Computational Complexity
A Construction for Multisecret Threshold Schemes
Designs, Codes and Cryptography
Cryptography: Theory and Practice
Cryptography: Theory and Practice
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
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Linear threshold multisecret sharing schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
A multi-threshold secret image sharing scheme based on MSP
Pattern Recognition Letters
Linear threshold multisecret sharing schemes
Information Processing Letters
| Hi-index | 0.00 |
A multisecret threshold scheme is a system which protects a number of secret keys among a group of n participants. There is a secret sK associated with every subset K of k participants such that any t participants in K can reconstruct the secret sK, but a subset of w participants cannot get any information about a secret they are not associated with. This paper gives a construction for the parameters t = 2, k = 3 and for any n and w that is optimal in the sense that participants hold the minimal amount of information.