Multiparty unconditionally secure protocols

  • Authors:
  • David Chaum;Claude Crépeau;Ivan Damgard

  • Affiliations:
  • Centre for Mathematics and Computer Science (C.W.I.), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands;Laboratory for Computer Science, M.I.T., 545 Technology Square, Cambridge, MA, U.S.A.;Mathematisk Institut, Aarhus Universitet, Ny Munkegade, DK 8000 Aarhus C, Denmark

  • Venue:
  • STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
  • Year:
  • 1988

Quantified Score

Hi-index 0.02

Visualization

Abstract

Under the assumption that each pair of participants can communicate secretly, we show that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest. The secrecy achieved is unconditional. It does not rely on any assumption about computational intractability.