Monotonicity conjecture for communication complexity under user-set changes

Let $R_{\op{S}}$ be the minimum communication rate required to achieve the secrecy capacity in the secret-key agreement model. A trusted helper is a user whose source is trusted and who is not initially active, a vocal active user communicates at strictly positive rate, and a source $\RZ_i$ determines a source $\RZ_j$ when $H(\RZ_j\mid\RZ_i)=0$. Monotonicity conjecture. $R_{\op{S}}$ does not increase under either of the following changes: (i) making a trusted helper active, provided that the helper's private source determines the private source of another active user; or (ii) forcing a vocal active user to be silent, provided that its private source is determined by that of another vocal user. These conjectures are proposed as possible improvements to the lower bound on communication complexity. The source says they would follow from the stronger MKS16 conjecture that private randomization does not decrease $R_{\op{S}}$, but does not establish them independently.