Los puntos clave no están disponibles para este artículo en este momento.
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.
Chaum et al. (Fri,) studied this question.