Topology of covert conflict

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

1 Citation (Scopus)

Abstract

This is a short talk on topology of covert conflict, comprising joint work I’ve been doing with Ross Anderson. The background of this work is the following. We consider a conflict, and there are parties to the conflict. There is communication going on that can be abstracted as a network of nodes (parties) and links (social ties between the nodes). We contend that once you’ve got a conflict and you’ve got enough parties to it, these guys start communicating as a result of the conflict. They form connections, that influences the conflict, and the dynamics of the conflict in turn feeds the connectivity of the unfolding network.

Modern conflicts often turn on connectivity: consider, for instance, anything from the American army’s attack on the Taleban in Afghanistan, and elsewhere, or medics who are trying to battle a disease, like Aids, or anything else. All of these turn on, making strategic decisions about which nodes to go after in the network. For instance, you could consider that a good first place to give condoms out and start any Aids programme, would be with prostitutes.
Original languageEnglish
Title of host publicationSecurity Protocols 2005 - 13th International Workshop, Revised Selected Papers
EditorsB. Christianson , B. Crispo , J. A. Malcolm, M. Roe
Place of PublicationBerlin
PublisherSpringer
Pages329-332
Number of pages4
Volume4631
ISBN (Print)9783540771555
DOIs
Publication statusPublished - 1 Dec 2007
Event13th International Security Protocols Workshop - Cambridge, United Kingdom
Duration: 20 Apr 200522 Apr 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4631 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Security Protocols Workshop
Country/TerritoryUnited Kingdom
CityCambridge
Period20/04/0522/04/05

Keywords

  • random network
  • average short path
  • average short path length
  • anonymous communication
  • vertex order
  • covert conflict
  • connectivity

Cite this