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.
We don't have any images related to Multi-party fair exchange protocol yet.
You can add one yourself here.
We don't have any YouTube videos related to Multi-party fair exchange protocol yet.
You can add one yourself here.
We don't have any PDF documents related to Multi-party fair exchange protocol yet.
You can add one yourself here.
We don't have any Books related to Multi-party fair exchange protocol yet.
You can add one yourself here.
We don't have any archived web articles related to Multi-party fair exchange protocol yet.
Definition
Matthew K. Franklin and Gene Tsudik suggested in 19982 the following classification:
- An n {\displaystyle n} -party single-unit general exchange is a permutation σ {\displaystyle \sigma } on { 1... n } {\displaystyle \{1...n\}} , where each party P i {\displaystyle P_{i}} offers a single unit of commodity K i {\displaystyle K_{i}} to P σ ( i ) {\displaystyle P_{\sigma (i)}} , and receives a single unit of commodity K σ − 1 ( i ) {\displaystyle K_{\sigma ^{-1}(i)}} from P σ − 1 ( i ) {\displaystyle P_{\sigma ^{-1}(i)}} .
- An n {\displaystyle n} -party multi-unit general exchange is a matrix of baskets, where the entry B i j {\displaystyle B_{ij}} in row i {\displaystyle i} and column j {\displaystyle j} is the basket of goods given by P i {\displaystyle P_{i}} to P j {\displaystyle P_{j}} .
See also
Secure multi-party computation
References
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. ↩
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. Vol. 1465. pp. 90–102. doi:10.1007/BFb0055475. ISBN 978-3-540-64951-9. 978-3-540-64951-9 ↩