Collusion detection for grid computing

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGRID 2009

Volumn , Issue , 2009, Pages 412-419

  Staab, Eugen ^a   Engel, Thomas ^a  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

[No Author keywords available]

Indexed keywords

COLLUDERS; COLLUSION DETECTION; MAJORITY VOTING;

CLUSTER COMPUTING; COMPUTER SCIENCE;

GRID COMPUTING;

EID: 70349971098     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2009.12     Document Type: Conference Paper

References (26)

1. D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. SETI@home: an experiment in publicresource computing. Commun. ACM, 45(11):56-61, 2002.
2. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In Proc. of the 11th Annual European Symposium on Algorithms, volume 2832 of LNCS, pages 568-579. Springer, 2003.
3. distributed.net projects, February 2009. http://www. distributed.net/.
4. J. R. Douceur. The sybil attack. In Revised Papers from the 1st Int. Workshop on Peer-to-Peer Systems (IPTPS '01), pages 251-260. Springer Verlag, 2002.
5. W. Du, J. Jia, M. Mangal, and M. Murugesan. Uncheatable grid computing. In Proc. of the 24th Int. Conf. on Distributed Computing Systems (ICDCS'04), pages 4-11. IEEE Computer Society, 2004.
6. M. Evans, N. Hastings, and B. Peacock. Statistical Distributions. John Wiley&Sons, Inc., New York, NY, USA, third edition, 2000.
7. G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis. Graph clustering and minimum cut trees. Internet Mathematics, 1(4), 2004.
8. Folding@home distributed computing, February 2009. http://folding. stanford.edu/.
9. A. V. Goldberg and K. Tsioutsiouliklis. Cut tree algorithms: An experimental study. Journal of Algorithms, 38(1):51-83, 2001.
10. P. Golle and S. G. Stubblebine. Secure distributed computing in a commercial environment. In Proc. of the 5th Int. Conf. on Financial Cryptography (FC '01), pages 289-304.Springer Verlag, 2002.
11. D. Kondo, F. Araujo, P. Malecot, P. Domingues, L. M. Silva, G. Fedak, and F. Cappello. Characterizing result errors in internet desktop grids. In Proc. of the 13th European Conf. on Parallel Processing (EURO-PAR '07), volume 4641 of LNCS, pages 361-371. Springer Verlag, 2007.
12. D. Kondo, M. Taufer, C. L. Brooks, H. Casanova, and A. A. Chien. Characterizing and evaluating desktop grids: An empirical study. In Proc. of the Int. Parallel and Distributed Processing Symposium (IPDPS'04), pages 26-35. IEEE Computer Society, 2004.
13. D. Molnar. On patrol: The SETI@home problem. ACM Crossroads: E-commerce, 7(1), September 2000.
14. D. S. Moore. The Basic Practice of Statistics. W. H. Freeman&Co., New York, NY, USA, fourth edition, 2007.
15. C. J. V. Rijsbergen. Information Retrieval. Butterworth- Heinemann, Newton, MA, USA, 1979.
16. J.-L. Roch and S. Varrette. Probabilistic certification of divide&conquer algorithms on global computing platforms: application to fault-tolerant exact matrix-vector product. In Proc. of the Int. Wksh. on Parallel Symbolic Computation (PASCO '07), pages 88-92. ACM, 2007.
17. L. F. G. Sarmenta. Sabotage-tolerance mechanisms for volunteer computing systems. In Proc. of the 1st Int. Symposium on Cluster Computing and the Grid (CCGrid '01), pages 337-346. IEEE Computer Society, 2001.
18. G. C. Silaghi, F. Araujo, L. M. Silva, P. Domingues, and A. Arenas. Defeating colluding nodes in desktop grids computing platforms. In Proc. of the 2nd Workshop on Desktop Grids and Volunteer Computing (PCGrid '08). IEEE Computer Society, 2008.
19. E. Staab, V. Fusenig, and T. Engel. Using correlation for collusion detection in grid settings. Technical Report 000657499, University of Luxembourg, July 2008.
20. W. Stallings. Cryptography and Network Security: Principles and Practice. Pearson Education, Upper Saddle River, New Jersey, USA, third edition, 2003.
21. M. Taufer, D. Anderson, P. Cicotti, and C. L. B. III. Homogeneous redundancy: a technique to ensure integrity of molecular simulation results using public computing. In Proc. of the 19th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS '05) - Workshop 1, page 119.1,Washington, DC, USA, 2005. IEEE Computer Society.
22. R. G. und T.C. Hu. Multi-terminal network flows. Journal of SIAM, 9:551-570, 1961.
23. S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000.
24. H. Wasserman and M. Blum. Software reliability via runtime result-checking. J. ACM, 44(6):826-849, 1997.
25. M. Yurkewych, B. N. Levine, and A. L. Rosenberg. On the cost-ineffectiveness of redundancy in commercial P2P computing. In Proc. of the 12th Conf. on Computer and Communications Security (CCS '05), pages 280-288. ACM, 2005.
26. S. Zhao, V. Lo, and C. GauthierDickey. Result verification and trust-based scheduling in peer-to-peer grids. In Proc. of the 5th IEEE Int. Conf. on Peer-to-Peer Computing (P2P '05), pages 31-38. IEEE Computer Society, 2005.