Searching for high-value rare events with uncheatable grid computing

Lecture Notes in Computer Science

Volumn 3531, Issue , 2005, Pages 122-137

  Du, Wenliang ^a   Goodrich, Michael T ^b  

^a Syracuse University   (United States)

^b Irvine   (United States)

Author keywords

Cheating; Cryptographic hash functions; Grid computing; Obfuscation; Security

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; FUNCTIONS; SECURITY OF DATA;

CHEATING; CRYPTOGRAPHIC HASH FUNCTIONS; GRID COMPUTING; OBFUSCATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 26444461543     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496137_9     Document Type: Conference Paper

References (18)

1. Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, and Bart Selman. Generating satisfiable problem instances. In AAAI/IAAI, pages 256-261, 2000.
2. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. Lecture Notes in Computer Science, 1592:402-414, 1999.
3. W. Du, J. Jia, M. Mangal, and M. Murugesan. Uncheatable grid computing. In The 24th International Conference on Distributed Computing Systems (ICDCS'04), pages 4-11, Tokyo, Japan, March 23-26 2004.
4. P. Golle and I. Mironov. Uncheatable distributed computations. Lecture Notes in Computer Science, 2020:425-440, 2001.
5. P. Golle and S. Stubblebine. Secure distributed computing in a commercial environment. In P. Syverson, editor, Proceedings of Financial Crypto 2001, volume 2339 of Lecture Notes in Computer Science, pages 289-304. Springer-Verlag, 2001.
6. M. T. Goodrich and R. Tamassia. Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, New York, NY, 2002.
7. F. Hohl. Time limited blackbox security: Protecting mobile agents from malicious hosts. Mobile Agents and Security, Lecture Notes in Computer Science, Springer-Verlag, 1419:92-113, 1998.
8. L. Kahney. Cheaters bow to peer pressure. Wired Magazine, Feb. 15, 2001.
9. Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, and Mark E. Stickel. Balance and filtering in structured satisfiable problems. In IJCAI, pages 351-358, 2001.
10. F. Massacci and L. Marraro. Logical cryptanalysis as a SAT problem: The encoding of the Data Encryption Standard. Journal of Automated Reasoning, 24(1-2): 165-203, 2000.
11. F. Monrose, P. Wykoff, and Aviel D. Rubin. Distributed execution with remote audit. In Proceedings of ISOC Symposium on Network and Distributed System Security, pages 103-113, February 1999.
12. T. Sander and C. F. Tschudin. Protecting mobile agents against malicious hosts, springer-verlag. Lecture Notes in Computer Science, 1419:44-60, 1998.
13. D. Szajda, B. Lawson, and J. Owen. Hardening functions for large scale distributed computations. IEEE Symposium on Security and Privacy, 2003.
14. G. Vigna. Protecting mobile agents through tracing. In Proceedings of the 3rd Workshop on Mobile Object Systems, June 1997.
15. G. Vigna, editor. Mobile Agents and Security, volume 1419 of Lecture Notes in Computer Science. Springer, 1998.
16. R. Ostrovsky W. Aiello, S. Bhatt and S. Rajagopalan. Fast verification of any remote procedure call: short witness-indistinguishable one-round proofs for np. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 463-474, July 2000.
17. F. Schneider Y. Minsky, R. van Renesse and S. D. Stoller. Cryptographic support for fault-tolerant distributed computing. In Proceedings of Seventh ACM SIGOPS European Workshop, System Support for Worldwide Applications, pages 109-114, Connemara, Ireland, September 1996.
18. B. S. Yee. A sanctuary for mobile agents. In Secure Internet Programming, pages 261-273, 1999.