Proceedings of CRYPTO 84 on Advances in cryptology
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Elements of information theory
Elements of information theory
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
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the information rate of perfect secret sharing schemes
Designs, Codes and Cryptography
Perfect Secret Sharing Schemes on Five Participants
Designs, Codes and Cryptography
A Linear Construction of Secret Sharing Schemes
Designs, Codes and Cryptography
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
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
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Nonperfect Secret Sharing Schemes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
General Perfect Secret Sharing Schemes
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Efficient secret sharing without a mutually trusted authority
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
General short computational secret sharing schemes
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A Linear Construction of Secret Sharing Schemes
Designs, Codes and Cryptography
Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions
Information Processing Letters
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
A secret sharing schemefor an incomplete access structure (\G,\D) is amethod of distributing information about a secret among a groupof participants in such a way that sets of participants in \Gcan reconstruct the secret and sets of participants in \Dcan not obtain any new information about the secret. In thispaper we present a more precise definition of secret sharingschemes in terms of information theory, and a new decompositiontheorem. This theorem generalizes previous decomposition theoremsand also works for a more general class of access structures.We demonstrate some applications of the theorem.