Journal of Cryptology
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Bayanihan: building and studying web-based volunteer computing systems using Java
Future Generation Computer Systems - Special issue on metacomputing
Cryptographic support for fault-tolerant distributed computing
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
ATLAS: an infrastructure for global computing
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
ParaWeb: towards world-wide supercomputing
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Cryptographic Traces for Mobile Agents
Mobile Agents and Security
Protecting Mobile Agents Against Malicious Hosts
Mobile Agents and Security
Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Globally Distributed Computation over the Internet - The POPCORN Project
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Proceedings of the 2nd conference on Computing frontiers
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
Combinatorial agency with audits
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
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
Pay as you browse: microcomputations as micropayments in web-based services
Proceedings of the 20th international conference on World wide web
Privacy-preserving outsourcing of brute-force key searches
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
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
Validating evolutionary algorithms on volunteer computing grids
DAIS'10 Proceedings of the 10th IFIP WG 6.1 international conference on Distributed Applications and Interoperable 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
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 past few years have seen the development of distributedcomputing platforms designed to utilize the spareprocessor cycles of a large number of personal computersattached to the Internet in an effort to generate levelsof computing power normally achieved only with expensivesupercomputers. Such large scale distributed computationsrunning in untrusted environments raise a numberof security concerns, including the potential for intentionalor unintentional corruption of computations, and for participantsto claim credit for computing that has not beencompleted. This paper presents two strategies for hardeningselected applications that utilize such distributed computations.Specifically, we show that carefully seeding certaintasks with precomputed data can significantly increaseresistance to cheating (claiming credit for work not computed)and incorrect results. Similar results are obtainedfor sequential tasks through a strategy of sharing the computationof N tasks among K N nodes. In each case, theassociated cost is significantly less than the cost of assigningtasks redundantly.