Optimal Revocations in Ephemeral Networks: A Game-Theoretic Framework

Revocation of public-key certificates is an important security primitive. 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. 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 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.


Published in:
Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2010), 184-193
Presented at:
8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2010), Avignon, France, June 1-3, 2010
Year:
2010
Publisher:
IEEE
Keywords:
Laboratories:




 Record created 2010-05-26, last modified 2018-03-18

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)