Multi-party fair exchange protocol

From HandWiki

In cryptography, a multi-party fair exchange protocol is protocol where parties accept to deliver an item if and only if they receive an item in return.[1]

Definition

Matthew K. Franklin and Gene Tsudik suggested in 1998[2] the following classification:

  • An [math]\displaystyle{ n }[/math]-party single-unit general exchange is a permutation [math]\displaystyle{ \sigma }[/math] on [math]\displaystyle{ \{1...n\} }[/math], where each party [math]\displaystyle{ P_i }[/math] offers a single unit of commodity [math]\displaystyle{ K_i }[/math] to [math]\displaystyle{ P_{\sigma(i)} }[/math], and receives a single unit of commodity [math]\displaystyle{ K_{\sigma^{-1}(i)} }[/math] from [math]\displaystyle{ P_{\sigma^{-1}(i)} }[/math].
  • An [math]\displaystyle{ n }[/math]-party multi-unit general exchange is a matrix of baskets, where the entry [math]\displaystyle{ B_{ij} }[/math] in row [math]\displaystyle{ i }[/math] and column [math]\displaystyle{ j }[/math] is the basket of goods given by [math]\displaystyle{ P_i }[/math] to [math]\displaystyle{ P_j }[/math].

See also

Secure multi-party computation

References

  1. Mukhamedov, Aybek; Kremer, Steve; Ritter, Eike. "Analysis of a Multi-Party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space model". Financial Crypto 2005. 
  2. Franklin, Matthew K.; Tsudik, Gene (1998). "Secure group barter: Multi-party fair exchange with semi-trusted neutral parties". Financial Cryptography. Lecture Notes in Computer Science. 1465. pp. 90–102. doi:10.1007/BFb0055475. ISBN 978-3-540-64951-9.