Untraceable off-line cash in wallet with observers
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Sabotage-tolerance mechanisms for volunteer computing systems
Future Generation Computer Systems - Best papers from symp. on cluster computing and the grid (CCGRID 2001)
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Secure Distributed Computing in a Commercial Environment
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Hardening Functions for Large Scale Distributed Computations
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Secure distributed human computation
Proceedings of the 6th ACM conference on Electronic commerce
Conditional e-payments with transferability
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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.