Dining cryptographers and their variants are usually fully proven in the sense that when all but one input is zero, you will receive the intended input. You always receive the combination under the operation you are using (i.e. xor of all messages).