![]() |
|
|||
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
|
![]() |
[an error occurred while processing this directive]
If Γ is an access structure, then B ∈ Γ is a minimal authorized subset if A ∉ Γ whenever We say that Γ is the closure of Γ0 and write Example 11.2 Suppose Then Conversely, given this access structure Γ, it is easy to see that Γ0 consists of the minimal subsets in Γ. In the case of a (t, w)-threshold access structure, the basis consists of all subsets of (exactly) t participants. 11.3 The Monotone Circuit ConstructionIn this section, we will give a conceptually simple and elegant construction due to Benaloh and Leichter that shows that any (monotone) access structure can be realized by a perfect secret sharing scheme. The idea is to first build a monotone circuit that recognizes the access structure, and then to build the secret sharing scheme from the description of the circuit. We call this the monotone circuit construction. Suppose we have a boolean circuit C, with w boolean inputs, x1, . . . , xw (corresponding to the w participants P1, . . . , Pw), and one boolean output, y. The circuit consists of or gates and and gates; we do not allow any not gates. Such a circuit is called a monotone circuit. The reason for this nomenclature is that changing any input xi from 0 (false) to 1 (true) can never result in the output y changing from 1 to 0. The circuit is permitted to have arbitrary fan-in, but we require fan-out equal to 1 (that is, a gate can have arbitrarily many input wires, but only one output wire). If we specify boolean values for the w inputs of such a monotone circuit, we can define i.e., the subset of where C (x1, . . . , xw) denotes the output of C, given inputs x1, . . . , xw. Since the circuit C is monotone, it follows that Γ(C) is a monotone set of subsets of It is easy to see that there is a one-to-one correspondence between monotone circuits of this type and boolean formulae which contain the operators If Γ is a monotone set of subsets of In Example 11.2, where we would obtain the boolean formula Each clause in the boolean formula corresponds to an and gate of the associated monotone circuit; the final disjunction corresponds to an or gate. The number of gates in the circuit is |Γ0| + 1. Suppose C is any monotone circuit that recognizes Γ (note that C need not be the circuit described above.) We describe an algorithm which enables D, the dealer, to construct a perfect secret sharing scheme that realizes Γ. This scheme will use as a building block the (t, t)-schemes constructed in Figure 11.2. Hence, we take the key set to be The algorithm proceeds by assigning a value A description of the construction is given in Figure 11.3. Note that, whenever a gate G is an and gate having (say) t input wires, we share the key f(WG) among the input wires using a (t, t)-threshold scheme. Lets carry out this procedure for the access structure of Example 11.2, using the circuit corresponding to the boolean formula (11.1).
Copyright © CRC Press LLC
![]() |
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |