Secure Internet programming
Cryptographic support for fault-tolerant distributed computing
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
Mobile Agents and Security
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Secure Distributed Computing in a Commercial Environment
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
Mobile Agents and Security
Protecting Mobile Agents Against Malicious Hosts
Mobile Agents and Security
Hardening Functions for Large Scale Distributed Computations
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Algorithm Design: Foundations, Analysis and Internet Examples
Algorithm Design: Foundations, Analysis and Internet Examples
Balance and filtering in structured satisfiable problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science
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
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)
| Hi-index | 0.00 |
High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (which comprise the computation grid) in such a way that clients are rewarded for performing tasks assigned to them. Although natural, rare-event searching presents significant challenges for a computation supervisor, who partitions and distributes the search space out to clients while contending with “lazy” clients, who don't do all their tasks, and “hoarding” clients, who don't report rare events back to the supervisor. We provide schemes, based on a technique we call chaff injection, for efficiently performing uncheatable grid computing in the context of searching for high-value rare events in the presence of coalitions of lazy and hoarding clients.