Encrypting problem instances: Or ... can you take advantage of someone without having to trust him?
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Proofs of Work and Bread Pudding Protocols
CMS '99 Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
P2P contracts: a framework for resource and service exchange
Future Generation Computer Systems - Special issue: P2P computing and interaction with grids
On the cost-ineffectiveness of redundancy in commercial P2P computing
Proceedings of the 12th ACM conference on Computer and communications security
Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures
IEEE Transactions on Parallel and Distributed 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
Algorithms and theory of computation handbook
An authentication protocol in web-computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Secure remote execution of sequential computations
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Towards Trusted Services: Result Verification Schemes for MapReduce
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Secure and verifiable outsourcing of large-scale biometric computations
ACM Transactions on Information and System Security (TISSEC)
Hi-index | 0.00 |
The recent successes of a number of nonprofit computing projects distributed over the Internet has generated intense interest in the potential commercial applications of distributed computing. In a commercial setting, where participants might be paid for their contributions, it is crucial to define a security framework to address the threat of cheating and offer guarantees that the computation has been correctly executed. This paper defines and analyzes such a security framework predicated on the assumption that participants are motivated by financial gain. We propose a scheme which deters participants from claiming credit for work they have not done, and puts a high cost on attempts to disrupt the computation. We achieve these two goals by integrating an algorithm to assign computations to participants, an algorithm to verify their work, and an algorithm to pay participants.