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.
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
Brands, S.: Untraceable off-line cash in wallets with observers (extended abstract). In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302–318. Springer, Heidelberg (1994)
Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319–327. Springer, Heidelberg (1990)
Du, W., Jia, J., Mangal, M., Murugesan, M.: Uncheatable grid computing. In: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS) (2004)
Gentry, C., Ramzan, Z., Stubblebine, S.G.: Secure distributed human computation. In: ACM Conference on Electronic Commerce (2005)
Golle, P., Mironov, I.: Uncheatable distributed computations. In: Proceedings of RSA Conference 2001, Cryptographer’s track. LNCS, pp. 425–440. Springer, Heidelberg (2001)
Golle, P., Stubblebine, S.G.: Secure distributed computing in a commercial environment. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, pp. 279–304. Springer, Heidelberg (2002)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACMÂ 21(2) (1978)
Sarmenta, L.F.G.: Sabotage-tolerance mechanisms for volunteer computing systems. In: Future Generation Computer Systems: Special Issue on Cluster Computing and the Grid, March 18 (2002)
Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)
Szajda, D., Lawson, B., Owen, J.: Hardening functions for large-scale distributed computations. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 216–224 (2003)
Szajda, D., Lawson, B., Owen, J.: Toward an optimal redundancy strategy for distributed computations. In: Proceedings of the 2005 IEEE International Conference on Cluster Computing (Cluster) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carbunar, B., Tripunitara, M. (2008). Conditional Payments for Computing Markets. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds) Cryptology and Network Security. CANS 2008. Lecture Notes in Computer Science, vol 5339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89641-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-89641-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89640-1
Online ISBN: 978-3-540-89641-8
eBook Packages: Computer ScienceComputer Science (R0)