Pipelined algorithms to detect cheating in long-term grid computations

Theoretical Computer Science

Volumn 408, Issue 2-3, 2008, Pages 199-207

  Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

Grid computing; Parallel algorithms; Pipelined algorithms; Security

Indexed keywords

ALGORITHMS; ECONOMIC ANALYSIS; GRID COMPUTING; RISK ASSESSMENT;

COLLUSION ATTACKS; DETECTION ALGORITHMS; DIAGNOSIS PROBLEMS; EFFICIENT SOLUTIONS; GRID COMPUTATIONS; INTERLEAVED SEQUENCES; PARALLEL PROCESSORS; PIPELINED ALGORITHMS; SECURITY;

PARALLEL ALGORITHMS;

EID: 55049105395     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.08.008     Document Type: Article

References (23)

1. Becker G.S. The Economic Approach to Human Behavior (1976), Univ. of Chicago Press
2. R. Beigel, W. Hurwood, N. Kahale, Fault diagnosis in a flash, in: IEEE Symposium on Foundations of Computer Science, FOCS, 1995, pp. 571-580
3. R. Beigel, G. Margulis, D.A. Spielman, Fault diagnosis in a small constant number of parallel testing rounds, in: ACM Symposium on Parallel Algorithms and Architectures, SPAA, 1993, pp. 21-29
4. Blum M., Evans W., Gemmell P., Kannan S., and Naor M. Checking the correctness of memories. Proc. 32nd Symp. Foundations of Computer Science (Oct. 1991), IEEE Computer Society, San Juan, PR 90-99
5. M. Blum, S. Kannan, Designing programs that check their work, in: Proc. 21st ACM Symp. Theory of Comp., Seattle, Washington, 1989, pp. 86-97
6. Blum M., and Kannan S. Designing programs that check their work. J. ACM 42 1 (1995) 269-291
7. Blum M., Luby M., and Rubinfeld R. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47 3 (1993) 549-595
8. Cachin C., Micali S., and Stadler M. Computationally private information retrieval with polylogarithmic communication. Lecture Notes in Computer Science vol. 1592 (1999) 402-414
9. Devillers O., Liotta G., Preparata F.P., and Tamassia R. Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Theory Appl. 11 (1998) 187-208
10. Du W., and Goodrich M.T. Searching for high-value rare events with uncheatable grid computing. 3rd Applied Cryptography and Network Security Conference. ACNS. Lecture Notes in Computer Science vol. 3531 (2005), Springer 122-137
11. W. Du, J. Jia, M. Mangal, M. Murugesan, Uncheatable grid computing, in: The 24th International Conference on Distributed Computing Systems, ICDCS'04, Tokyo, Japan, March 23-26, 2004, pp. 4-11
12. U. Finkler, K. Mehlhorn, Checking priority queues, in: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. S901-S902
13. Golle P., and Mironov I. Uncheatable distributed computations. Topics in Cryptology-CT-RSA, The Cryptographer's Track at the RSA Conference, Proceedings. Lecture Notes in Computer Science vol. 2020 (2001), Springer 425-440
14. Golle P., and Stubblebine S. Secure distributed computing in a commercial environment. In: Syverson P. (Ed). Proceedings of Financial Crypto 2001. Lecture Notes in Computer Science vol. 2339 (2001), Springer-Verlag 289-304
15. Kahney L. Cheaters bow to peer pressure. Wired Magazine Feb. 15 (2001)
16. Kannan S., and Yao A. Program checkers for probability generation. Proc. Int. Colloq. Automata, Languages, and Programming (July 1991), Springer-Verlag 163-173
17. D. Kratsh, R. McConnell, K. Mehlhorn, J. Spinrad, Certifying algorithms for recognizing interval and permutation graphs, in: Proc. ACM-SIAM Symp. on Discrete Algorithms, 2003
18. Lipton R. New directions in testing. Distributed Computing and Cryptography. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 2 (1991), American Mathematics Society 191-202
19. R. Rubinfeld, Designing checkers for programs that run in parallel. Technical Report TR-090-040, International Computer Science Institute, Berkeley, CA, Aug. 1990
20. G.F. Sullivan, G.M. Masson, Using certification trails to achieve software fault tolerance, in: Digest 1990 Fault Tolerant Comp. Symp., 1990, pp. 423-431
21. Sullivan G.F., and Masson G.M. Certification trails for data structures. Digest of the 21st Symposium on Fault-Tolerant Computing (1991), IEEE Computer Society Press 240-247
22. D. Szajda, B. Lawson, J. Owen, Hardening functions for large scale distributed computations, in: IEEE Symposium on Security and Privacy, 2003
23. R.O.W. Aiello, S. Bhatt, 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, July 2000, pp. 463-474