Revocation games in ephemeral networks

Maxim Raya, Mohammad Hossein Manshaei, Márk Félegyházi, Jean Pierre Hubaux

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

43 Scopus citations


A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact times between nodes are short and neighbors change frequently - reputations are hard to build. In this case, local revocation is a faster and more efficient alternative. In this paper. we define a game-theoretic model to analyze the various local revocation strategies. We establish and prove the conditions leading to subgame-perfect equilibria. We also derive the optimal parameters for voting-based schenies. Then we design a protocol based on our analysis and the practical aspects that cannot be captured in the model. With realistic simulations on ephemeral networks we compare time performance and economic costs of the different techniques.

Original languageEnglish (US)
Title of host publicationProceedings of the 15th ACM Conference on Computer and Communications Security, CCS'08
Number of pages12
StatePublished - 2008
Externally publishedYes
Event15th ACM conference on Computer and Communications Security, CCS'08 - Alexandria, VA, United States
Duration: Oct 27 2008Oct 31 2008

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221


Other15th ACM conference on Computer and Communications Security, CCS'08
Country/TerritoryUnited States
CityAlexandria, VA


  • Ephemeral networks
  • Game theory
  • Revocation

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications


Dive into the research topics of 'Revocation games in ephemeral networks'. Together they form a unique fingerprint.

Cite this