OREN: Optimal revocations in ephemeral networks Article

Bilogrevic, I, Manshaei, MH, Raya, M et al. (2011). OREN: Optimal revocations in ephemeral networks . Computer Networks, 55(5), 1168-1180. 10.1016/j.comnet.2010.11.010

cited authors

  • Bilogrevic, I; Manshaei, MH; Raya, M; Hubaux, JP

abstract

  • 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. © 2010 Elsevier B.V. All rights reserved.

authors

publication date

  • April 1, 2011

published in

Digital Object Identifier (DOI)

start page

  • 1168

end page

  • 1180

volume

  • 55

issue

  • 5