Software reliability via run-time result-checking
Journal of the ACM (JACM)
Cut tree algorithms: an experimental study
Journal of Algorithms
The Basic Practice of Statistics with Cdrom
The Basic Practice of Statistics with Cdrom
Information Retrieval
SETI@home: an experiment in public-resource computing
Communications of the ACM
Cryptography and Network Security: Principles and Practice
Cryptography and Network Security: Principles and Practice
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
Sabotage-Tolerance Mechanisms for Volunteer Computing Systems
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Result Verification and Trust-Based Scheduling in Peer-to-Peer Grids
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
On the cost-ineffectiveness of redundancy in commercial P2P computing
Proceedings of the 12th ACM conference on Computer and communications security
Proceedings of the 2007 international workshop on Parallel symbolic computation
Characterizing result errors in internet desktop grids
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Inter-domain pricing: challenges and possible approaches
International Journal of Network Management
| Hi-index | 0.00 |
A common technique for result verification in grid computing is to delegate a computation redundantly to different workers and apply majority voting to the returned results. However, the technique is sensitive to "collusion" where a majority of malicious workers collectively returns the same incorrect result. In this paper, we propose a mechanism that identifies groups of colluding workers. The mechanism is based on the fact that colluders can succeed in a vote only when they hold the majority. This information allows us to build clusters of workers that voted similarly in the past, and so detect collusion. We find that the more strongly workers collude, the better they can be identified.