Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Optimal file sharing in distributed networks (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
Non-perfect Secret Sharing over General Access Structures
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
The use of mathematical linguistic methods in creating secret sharing threshold algorithms
Computers & Mathematics with Applications
Space efficient secret sharing for implicit data security
Information Sciences: an International Journal
Ideal secret sharing schemes with share selectability
ICICS'11 Proceedings of the 13th international conference on Information and communications security
| Hi-index | 0.00 |
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. If any non qualified subset has absolutely no information about the secret, then the scheme is called perfect. Unfortunately, in this case the size of the shares cannot be less than the size of the secret. Krawczyk [9] showed how to improve this bound in the case of computational threshold schemes by using Rabin's information dispersal algorithms [14], [15]. We show how to extend the information dispersal algorithm for general access structure (we call access structure, the set of all qualified subsets). We give bounds on the amount of information each participant must have. Then we apply this to construct computational schemes for general access structures. The size of shares each participant must have in our schemes is nearly minimal: it is equal to the minimal bound plus a piece of information whose length does not depend on the secret size but just on the security parameter.