Reducing $n$ in $(n,k)$ secret sharing while keeping it effective Assume Bob wants to share a secret with Alice.
Assume he can only send messages using a one-sided channel which is insecure and unreliable.
Unreliable, meaning: Alice only gets messages sent over this channel with probability $P$.
Insecure, meaning: Mallory the bad guy can read any message sent over this channel with probability $P&#39;$.

Assuming $P&gt;P&#39;$, Bob can use $(n,k)$-secret sharing when $P&gt;k/n&gt;P&#39;$.
As Bob increases $n$, the probability that Alice receives a correct message increases and that Mallory receives a correct message decreases.
This is because the mean of secret shares Alice and Bob get remains $P n$ and $P&#39; n$ respectively, while the standard deviation drops as $n$ increases.

But there is more than one way to do this. For example, Bob and Alice could choose a relatively small $n$, transfer TWO secrets s.t. their XOR is the original secret. In this case Mallory's probability of learning the original secret will be squared, and decrease much faster than Alice's.

So my question is: Is 'classic' secret sharing ALWAYS the best way (giving the smallest possible $n$ for a given $P$ and $P'$)? I could not find a counter-example yet.
This sounds related to Wyner's "wiretap channel": Wyner showed that an asymmetry between receiver and eavesdropper could be used to achieve information-theoretic security. There have been many, many follow-up works since then. 

Reference:
A. D. Wyner, The wire-tap channel. Bell Sys. Tech. J., vol. 54, pp. 1355-1387, 1975.