A topological condition for solving fair exchange in byzantine environments

Details

Serval ID
serval:BIB_0350A8D762FE
Type
Article: article from journal or magazin.
Collection
Publications
Institution
Title
A topological condition for solving fair exchange in byzantine environments
Journal
Information and Communications Security, Lecture Notes in Computer Science (LNCS)
Author(s)
Garbinato B., Rickebusch I.
ISBN
978-3-540-49496-6
Publication state
Published
Issued date
12/2006
Peer-reviewed
Oui
Volume
4307
Pages
30-49
Language
english
Abstract
In this paper, we study the solvability of fair exchange in the context of Byzantine failures. In doing so, we first present a generic model with trusted and untrusted processes, and propose a specification of the fair exchange problem that clearly separates safety and liveness, via fine-grained properties. We then show that the solvability of fair exchange depends on a necessary and sufficient topological condition, which we name the reachable majority condition. The first part of this result, i.e., the condition is necessary, was shown in a companion paper and is briefly recalled here. The second part, i.e., the condition is sufficient, is the focal point of this paper. The correctness proof of this second part consists in proposing a solution to fair exchange in the aforementioned model.
Keywords
dop
Web of science
Publisher's website
Create date
26/05/2008 11:26
Last modification date
20/08/2019 13:25
Usage data