OREN: Optimal revocations in ephemeral networks

Igor Bilogrevic, Mohammad Hossein Manshaei, Maxim Raya, Jean Pierre Hubaux

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


Public-key certificates allow a multitude of entities to securely exchange and verify the authenticity of data. However, the ability to effectively revoke compromised or untrustworthy certificates is of great importance when coping with misbehavior. In this paper, we design a fully distributed local certificate revocation scheme for ephemeral networks - a class of extremely volatile wireless networks with short-duration and short-range communications - based on a game-theoretic approach. First, by providing incentives, we can guarantee the successful revocation of the malicious nodes even if they collude. Second, thanks to the records of past behavior, we dynamically adapt the parameters to nodes' reputations and establish the optimal Nash equilibrium (NE) on-the-fly, minimizing the social cost of the revocation. Third, based on the analytical results, we define OREN, a unique optimal NE selection protocol, and evaluate its performance through simulations. We show that our scheme is effective in quickly and efficiently removing malicious devices from the network.

Original languageEnglish (US)
Pages (from-to)1168-1180
Number of pages13
JournalComputer Networks
Issue number5
StatePublished - Apr 1 2011
Externally publishedYes


  • Ephemeral networks
  • Game theory
  • Revocations
  • Social optimum
  • Wireless security

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'OREN: Optimal revocations in ephemeral networks'. Together they form a unique fingerprint.

Cite this