Distributed Algorithms
Sabotage-tolerance mechanisms for volunteer computing systems
Future Generation Computer Systems - Best papers from symp. on cluster computing and the grid (CCGRID 2001)
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Volunteer computing
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
On the cost-ineffectiveness of redundancy in commercial P2P computing
Proceedings of the 12th ACM conference on Computer and communications security
| Hi-index | 0.00 |
A web-computing system (WCS) allows a host with limited resources to perform CPU intensive tasks by outsourcing the computations to external clients. But not every client is trusted, and redundancy in task assignment and auditing of results are needed to ensure the integrity of the results. This raises the question as to the efficiency and reliability of the system as measured against a given unit of the host's auditing time or cost. In this paper we propose a WCS with low overhead and has favorable error rate compared to a majority-voting scheme with similar efficiency. We can reduce the error rate by re-authenticating the results without having to resubmit any jobs, and we have an auditing strategy that in many cases is probabilistically better than random sampling.