Conditional payments for computing markets

16Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of outsourcing computations in distributed environments has several security challenges. These challenges stem from the lack of trust between the outsourcer and a worker. Previous work has extensively considered one side of the trust problem - the efficient verification of the completion of the outsourced computation. We believe this to be the first work that simultaneously addresses the other side of trust - ensuring valid remuneration for the work. We propose a solution in which the outsourcer embeds a verifiable payment token into the computation to be performed. With high probability, the worker can verify that if it completes the computation it will retrieve the payment, and the outsourcer is convinced that if the worker retrieves the payment then it has completed the computation. We also discuss the robustness of our scheme against two possible attacks that target the desired security properties, and possible extensions to our scheme. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Carbunar, B., & Tripunitara, M. (2008). Conditional payments for computing markets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5339 LNCS, pp. 317–331). https://doi.org/10.1007/978-3-540-89641-8_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free