I'm reading about the broadcast encryption described in Fiat and Naor's paper, I screen grabbed the relevant part below. My question is essentially:
If there's a secret:
$g^{abc}$ $mod$ $A$ (where $A=PQ$ (both sufficiently large primes))
why is it that one user who knows:
$g^d$ $mod$ $A$, $a$, $b$, $c$, $d$, and $A$
could not calculate $g^{abc}$ $mod$ $A$ but when you add a second user who know $g^e$ $mod$ $A$, and $e$, they can then collude to calculate $g^{abc}$ $mod$ $A$ ?
Context is provided below.
The full paper can be found here
The paper states that one user not in the privileged set could not calculate the secret, but two colluding users could (and so they rate the scheme 1-resilient).