Ir al contenido

Documat


Optimality in Asynchronous Contract Signing Protocols

  • Autores: Josep Lluis Ferrer Gomila Árbol académico, Maria Magdalena Payeras Capellà Árbol académico, Llorenç Huguet Rotger Árbol académico
  • Localización: Trust and Privacy in Digital Business: First International Conference,TrustBus 2004 Zaragoza, Spain, August 30 - September 1, 2004 Proceedings / coord. por Sokratis Katsikas, Günther Pernul, Javier López, 2004, ISBN 3540229191, págs. 200-208
  • Idioma: inglés
  • Texto completo no disponible (Saber más ...)
  • Resumen
    • Garay et alter [9] prove that for the multi-party contract signing with n participants, at least n rounds are necessary. To date, the best solution is Baum-Waidner’s scheme [6], with t+2 rounds (where t is the number of dishonest signatories, so with t=n–1, the number of rounds is n+1). Here, we propose an optimal solution with exactly n rounds. On the other hand, Pfitzmann et alter [10] state that “there is no asynchronous optimistic contract signing scheme with three messages in the optimistic case”. However, it seems that Ferrer et alter [7] invalidate the previous theorem with a counterexample, presenting an asynchronous protocol with only three messages. In this paper, we clarify this apparent contradiction.


Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno