Answers are grounded in this paper and cite their sources.
Under the assumption that each pair of participants em communieatc secretly, we show that any reasonable multiparty protwol can be achieved if at least Q of the Participants am honest. The secrecy achieved is unconditional, It does not rely on any assumption about computational intractability. 1.
No takes yet. Share an insight, caveat, or question.
Chaum et al. (1988) studied this question.