The server also needs to satisfy certain security constraints against the receivers and eavesdroppers.
That is, for each party \(i\in [m]\) , there is a set of messages \(P_i\subseteq B_i\) , which the party is prohibited from learning.
More specifically, party \(i\)  should not be able to infer any information about each individual message \(j\in P_i\)  given the side information \({x}_{A_i}\)  and the received codeword \(y\) .In [1]}, [2]}, [3]}, the eavesdropper is not allowed to learn any message apart from its own side information. That is, \(P_i=B_i\)  for eavesdropper \(i\) . Here we consider a slightly more general setup that allows any \(P_i\subseteq B_i\) .
