Trust but verify: monitoring remotely executing programs for progress and correctness
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Sabotage-tolerance and trust management in desktop grid computing
Future Generation Computer Systems
A Quantitative Comparison of Reputation Systems in the Grid
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Ridge: combining reliability and performance in open grid platforms
Proceedings of the 16th international symposium on High performance distributed computing
Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures
IEEE Transactions on Parallel and Distributed Systems
Future Generation Computer Systems
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science
Conditional Payments for Computing Markets
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Collusion Detection for Grid Computing
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Combinatorial agency with audits
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Agent-Based Autonomous Result Verification Mechanism in Desktop Grid Systems
Agents and Peer-to-Peer Computing
Group-based adaptive result certification mechanism in Desktop Grids
Future Generation Computer Systems
Securely outsourcing linear algebra computations
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Algorithms and theory of computation handbook
Privacy-preserving outsourcing of brute-force key searches
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Grid Interoperability Based on a Formal Design
Journal of Grid Computing
Lightweight monitoring of the progress of remotely executing computations
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
Searching for high-value rare events with uncheatable grid computing
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Internet computing of tasks with dependencies using unreliable workers
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Uncheatable reputation for distributed computation markets
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Secure remote execution of sequential computations
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Convergence analysis of evolutionary algorithms in the presence of crash-faults and cheaters
Computers & Mathematics with Applications
AUDIO: an integrity auditing framework of outlier-mining-as-a-service systems
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
New methods of secure outsourcing of scientific computations
The Journal of Supercomputing
Combinatorial pair testing: distinguishing workers from slackers
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Secure and verifiable outsourcing of large-scale biometric computations
ACM Transactions on Information and System Security (TISSEC)
Security and privacy for storage and computation in cloud computing
Information Sciences: an International Journal
| Hi-index | 0.00 |
Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x1, . . . , xn}, it needs to compute f(x) for all x 驴 D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel scheme to achieve the uncheatable grid computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable grid computing.