2000 | OriginalPaper | Buchkapitel
Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing
verfasst von : Birgit Baum-Waidner, Michael Waidner
Erschienen in: Automata, Languages and Programming
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We present the first optimistic n-party contract signing protocol for asynchronous networks that tolerates up to n - 1 dishonest signatories and terminates in the minimum number of rounds (O(n)). We also show how to make this protocol abuse-free by using standard cryptographic primitives (digital signatures, public-key encryption) only. Previous solutions required O(n2) rounds of communication, and nonstandard cryptographic primitives for abuse freeness.