Dynamic Topologies for Robust Scale-Free Networks

  • Shishir Nagaraja
  • Ross Anderson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5151)

Abstract

In recent years, the field of anonymity and traffic analysis have attracted much research interest. However, the analysis of subsequent dynamics of attack and defense, between an adversary using such topology information gleaned from traffic analysis to mount an attack, and defenders in a network, has recieved very little attention. Often an attacker tries to disconnect a network by destroying nodes or edges, while the defender counters using various resilience mechanisms. Examples include a music industry body attempting to close down a peer-to-peer file-sharing network; medics attempting to halt the spread of an infectious disease by selective vaccination; and a police agency trying to decapitate a terrorist organisation. Albert, Jeong and Barabási famously analysed the static case, and showed that vertex-order attacks are effective against scale-free networks. We extend this work to the dynamic case by developing a framework to explore the interaction of attack and defence strategies. We show, first, that naive defences don’t work against vertex-order attack; second, that defences based on simple redundancy don’t work much better, but that defences based on cliques work well; third, that attacks based on centrality work better against clique defences than vertex-order attacks do; and fourth, that defences based on complex strategies such as delegation plus clique resist centrality attacks better than simple clique defences. Our models thus build a bridge between network analysis and traffic analysis, and provide a framework for analysing defence and attack in networks where topology matters. They suggest definitions of efficiency of attack and defence, and may even explain the evolution of insurgent organisations from networks of cells to a more virtual leadership that facilitates operations rather than directing them. Finally, we draw some conclusions and present possible directions for future research.

Keywords

Scale-free networks robustness covert groups topology security 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, R., Barabási, A.L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74, 47 (2002)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406, 387–482 (2000)CrossRefGoogle Scholar
  3. 3.
    Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)MATHGoogle Scholar
  4. 4.
    Axelrod, R.: The Complexity of Cooperation. Princeton University Press, Princeton (1997)MATHGoogle Scholar
  5. 5.
    Ballester, C., Calvó-Armengol, A., Zenou, Y.: Who’s Who in Crime Networks – Wanted the Key Player, IUI Working Paper Series 617, The Research Institute of Industrial Economics (2004)Google Scholar
  6. 6.
    Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Bollobás, B.: Random Graphs. Academic Press, London (1985)MATHGoogle Scholar
  8. 8.
    Brandes, U.: A Faster Algorithm for Betweenness Centrality. J. Math. Soc. 25(2), 163–177 (2001)CrossRefMATHGoogle Scholar
  9. 9.
    Carrington, P.J., Scott, J., Wassermann, S.: Models and Methods in Social Network Analysis. Cambridge University Press, Cambridge (2005)CrossRefGoogle Scholar
  10. 10.
    Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1, 65–75 (1989)MathSciNetMATHGoogle Scholar
  11. 11.
    Erdös, P., Renyi, A.: On Random Graphs. Publicationes Mathematicae 6, 290–297 (1959)MathSciNetMATHGoogle Scholar
  12. 12.
    Freeman, L.C.: A set of measuring centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRefGoogle Scholar
  13. 13.
    Jackson, M.O.: A Survey of Models of Network Formation: Stability and Efficiency A. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics: Networks, Clubs, and Coalitions, Cambridge University Press, CambridgeGoogle Scholar
  14. 14.
    Krebs, V.E.: Mapping Networks of Terrorist Cells. Connections 12(3), http://www.locative.net/tcmreader/index.php?mapping;krebs
  15. 15.
    Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack Vulnerability of Complex Networks. Phys. Rev. E 65, art. no. 018101 (2002)Google Scholar
  16. 16.
    Milgram, S.: The Small World Problem. Psychology Today 2, 60–87 (1967)Google Scholar
  17. 17.
    Newmann, M.E.J.: Structure and Function of Complex Networks. SIAM Review 45, 167–256 (2003)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Sparrow, M.K.: The Application of Network Analysis to Criminal Intelligence: An assessment of the prospects. Social Networks 13, 253–274 (1990)Google Scholar
  19. 19.
    Thompson, N.: The Network Effect – Why Senegal’s bold anti-AIDS program is working. The Boston Globe (January 5, 2003), http://www.newamerica.net/index.cfm?pg=article&DocID=1092
  20. 20.
    Wassermann, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)CrossRefGoogle Scholar
  21. 21.
    Watts, D.J.: Six Degrees: The Science of a Connected Age. Norton, New York (2003)Google Scholar
  22. 22.
    Watts, D.J., Strogatz, S.H.: Collective Dynamics of Small-World Networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  23. 23.
    Zhao, L.A., Park, K.H., Lai, Y.C.: Attack vulnerability of scale-free networks due to cascading breakdown. Physical review E 70, 035101 (R) (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Shishir Nagaraja
    • 1
  • Ross Anderson
    • 1
  1. 1.Computer LaboratoryCambridgeUK

Personalised recommendations