Abstract
In the fair exchange problem, mutually untrusting parties must securely exchange digital goods. A fair exchange protocol must ensure that no combination of cheating or failures will result in some goods being delivered but not others, and that all goods will be delivered in the absence of cheating and failures.
This paper proposes two novel randomized protocols for solving fair exchange using simple trusted units. Both protocols have an optimal expected running time, completing in a constant (3) expected number of rounds. They also have optimal resilience. The first one tolerates any number of dishonest parties, as long as one is honest, while the second one, which assumes more agressive cheating and failures assumptions, tolerates up to a minority of dishonest parties.
The key insight is similar to the idea underlying the code-division multiple access (CDMA) communication protocol: outwitting an adversary is much easier if participants share a common, secret pseudo-random number generator.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspnes, J.: Randomized protocols for asynchronous consensus. Distributed Computing 16(2–3), 165–175 (2003)
Avoine, G., Gärtner, F., Guerraoui, R., Vukolic, M.: Gracefully degrading fair exchange with security modules. In: Proceedings of the Fifth European Dependable Computing Conference, pp. 55–71. Springer, Heidelberg (2005)
Borowsky, E., Gafni, E.: Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations. In: Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing, pp. 91–100. ACM Press, New York (1993)
Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685–722 (1996)
Chaudhuri, S.: Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, pp. 234–311. ACM Press, New York (1990)
Delporte-Gallet, C., Fauconnier, H., Freiling, F.C.: Revisiting failure detection and consensus in omission failure environments. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 394–408. Springer, Heidelberg (2005)
Dyer, J.G., Lindemann, M., Perez, R., Sailer, R., van Doorn, L., Smith, S.W., Weingart, S.: Building the IBM 4758 secure coprocessor. IEEE Computer 34(10), 57–66 (2001)
Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 148–161. ACM Press, New York (1988)
Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM) 32(2), 374–382 (1985)
Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM (JACM) 46(6), 858–923 (1999)
Pagnia, H., Vogt, H., Gärtner, F.C.: Fair exchange. The Computer Journal 46(1) (2003)
Parvédy, P.R., Raynal, M.: Optimal early stopping uniform consensus in synchronous systems with process omission failures. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 302–310. ACM Press, New York (2004)
Pease, M., Shostak, R., Lamport, L.: Reaching agreements in the presence of faults. Journal of the ACM (JACM) 27(2), 228–234 (1980)
Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing 29(5), 1449–1483 (2000)
Trusted Computing Group. Trusted computing group homepage. Internet (2003), https://www.trustedcomputinggroup.org/
Viterbi, A.J.: CDMA: Principles of Spread Spectrum Communication. Prentice-Hall, Englewood Cliffs (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freiling, F., Herlihy, M., Penso, L.D. (2006). Optimal Randomized Fair Exchange with Secret Shared Coins. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds) Principles of Distributed Systems. OPODIS 2005. Lecture Notes in Computer Science, vol 3974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795490_7
Download citation
DOI: https://doi.org/10.1007/11795490_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36321-7
Online ISBN: 978-3-540-36322-4
eBook Packages: Computer ScienceComputer Science (R0)