STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Communications of the ACM
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Hi-index | 0.00 |
We will present some ideas about sharing a secret in a monotonic access structure. We show the relations which occur between the method of encrypting a monotonic access structure with the use of basis sets or maximal unprivileged sets, and that based on a logical formula (used by Benaloh and Leichter in [1]). We will also give some facts connected with the problem of security, including the aspects of a hierarchy security in the structure. The method of encrypting a monotonic access structure using a family of basis sets or a family of maximal sets that cannot reconstruct the secret will be described in a general way. Some aspects of using the latter based on a logical formula will be also given. Any (general) access structure can be encrypted by each of them but the way of sharing a secret is quite different and usually a specified method has to be chosen to achieve a desirable level of security and time complexity.