Multisecret Threshold Schemes
نویسندگان
چکیده
A threshold scheme is a system that protects a secret (key) among a group of participants in such a way that it can only be reconstructed from the joint information held by some predetermined number of these participants. In this paper we extend this problem to one where there is more than one secret that participants can reconstruct using the information that they hold. In particular we consider the situation where there is a secret 8K associated with each k-subset K of participants and BK can be reconstructed by any group oft participants in K (t 5 k). We establish bounds on the minimum amount of information that participants must hold in order to ensure that up to w participants (0 5 w 5 n k + t 1) cannot obtain any information about a secret with which they are not associated. We also discuss examples of systems that satisfy this bound.
منابع مشابه
Linear Multisecret-Sharing Schemes and Error-Correcting Codes
In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharin...
متن کاملLinear Threshold Multisecret Sharing Schemes
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 informa...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملMultisecret Sharing Immune Against Cheating
Cheating in multisecret sharing is considered. Multisecret sharing is defined by a mapping F : GF (p) −→ GF (p) that provides a generic model. In this model, we propose nonlinear multisecret sharing that is immune against cheaters. Two cheating strategies are considered. In the first one, all cheaters always submit their invalid shares and they collectively know their own valid shares. In the s...
متن کاملGraphic Multisecret Sharing Schemes with One-Dimensional Cellular Automata
A multi-secret sharing scheme, which is based on one-dimensional reversible cellular automata with memory, allowing any member of a set of participants to share a secret color image with the rest of participants is presented. Moreover, it is also explained that with this scheme, any participant is able to recover all the secret color images if and only if the whole set of participants pools the...
متن کامل