An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Elements of information theory
Elements of information theory
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A Construction for Multisecret Threshold Schemes
Designs, Codes and Cryptography
Communications of the ACM
Linear Key Predistribution Schemes
Designs, Codes and Cryptography
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Linear broadcast encryption schemes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
An Optimal Multisecret Threshold Scheme Construction
Designs, Codes and Cryptography
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
Ideal Multipartite Secret Sharing Schemes
Journal of Cryptology
IEEE Transactions on Information Theory
| Hi-index | 0.89 |
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here information-theoretic secure schemes with multithreshold access structures. Namely, for every subset P of k users there is a secret key that can only be computed when at least t of them put together their secret information. Coalitions with at most w users with less than t of them in P cannot obtain any information about the secret associated to P. The main parameters to optimize are the length of the shares and the amount of random bits that are needed to set up the distribution of shares, both in relation to the length of the secret. In this paper, we provide lower bounds on this parameters. Moreover, we present an optimal construction for t=2 and k=3.