Fair Payments for Outsourced Computations

Initiated by volunteer computing efforts, the computation outsourcing problem can become a compelling application for networked set-top-boxes and mobile devices. In this paper we extend such environments with the ability to provide secure payments in exchange for outsourced CPU cycles. Previous contributions in wired networks have almost exclusively tackled only one side of the problem -- offering incentives for volunteer participation and preventing worker laziness. This makes sense in static environments where reputable outsourcers have little to gain from incorrectly rewarding honest participation. However, this assumption is no longer valid in ad hoc environments, where unique identities are difficult to provide and anyone can outsource computations. In this paper we propose a solution that simultaneously ensures correct remuneration for jobs completed on time and prevents worker laziness. Our solution relies on an offline bank to generate and redeem payments; the bank is oblivious to interactions between outsourcers and workers. In particular, the bank is not involved in job computation or verification. Our experiments show that the solution is efficient: the bank can perform hundreds of payment transactions per second and the overheads imposed on outsourcers and workers are negligible.

[1]  Philippe Golle,et al.  Uncheatable Distributed Computations , 2001, CT-RSA.

[2]  Alptekin Küpçü,et al.  Incentivizing outsourced computation , 2008, NetEcon '08.

[3]  Oded Goldreich Foundations of Cryptography: Index , 2001 .

[4]  Fabian Monrose,et al.  Distributed Execution with Remote Audit , 1999, NDSS.

[5]  Radu Sion,et al.  Uncheatable Reputation for Distributed Computation Markets , 2006, Financial Cryptography.

[6]  Oded Goldreich Foundations of Cryptography: Volume 1 , 2006 .

[7]  Oded Goldreich,et al.  Foundations of Cryptography: List of Figures , 2001 .

[8]  Jan Camenisch,et al.  Endorsed E-Cash , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

[9]  Luis F. G. Sarmenta Sabotage-tolerance mechanisms for volunteer computing systems , 2002, Future Gener. Comput. Syst..

[10]  Radu Sion,et al.  Conditional E-Cash , 2007, Financial Cryptography.

[11]  Barry Lawson,et al.  Toward an Optimal Redundancy Strategy for Distributed Computations , 2005, 2005 IEEE International Conference on Cluster Computing.

[12]  Philippe Golle,et al.  Secure Distributed Computing in a Commercial Environment , 2002, Financial Cryptography.

[13]  Doug Szajda,et al.  Hardening functions for large scale distributed computations , 2003, 2003 Symposium on Security and Privacy, 2003..

[14]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[15]  Arjen K. Lenstra,et al.  Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.

[16]  Wenliang Du,et al.  Uncheatable grid computing , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..