Multiparty Unconditionally Secure Protocols (Abstract)

  • David Chaum
  • Claude Crépeau
  • Ivan Damgård
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 293)


It has been shown previously how almost any multiparty protocol problem can be solved. All the constructions suggested so far rely on trapdoor one-way functions, and therefore must assume essentially that public key cryptography is possible. It has also been shown that unconditional protection of a single designated participant is all that can be achieved under that model. Assuming only authenticated secrecy channels between pairs of participants, we show that essentially any multiparty protocol problem can be solved. Such a model actually implies the further requirement that less than one third of the participants deviate from the protocol. The techniques presented do not, however, rely on any cryptographic assumptions; they achieve the optimal result and provide security as good as the secrecy and authentication of the channels used. Moreover, the constructions have a built-in fault tolerance: once the participants have sent messages committing themselves to the secrets they will use in the protocol, there is no way less than a third of them can stop the protocol from completing correctly. Our technique relies on the so called key-safeguarding or secret-sharing schemes proposed by Blakley and Shamir as basic building blocks. The usefulness of their homomorphic structure was observed by Benaloh, who proposed techniques very similar to ours.

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • David Chaum
    • 1
  • Claude Crépeau
    • 2
  • Ivan Damgård
    • 3
  1. 1.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands
  2. 2.Laboratory for Computer ScienceM.I.T.CambridgeUSA
  3. 3.Matematisk InstitutAarhus UniversitetAarhus CDanmark

Personalised recommendations