Parallel dedicated hardware devices for heterogeneous computations
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Location Privacy in Pervasive Computing
IEEE Pervasive Computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Self-Securing Ad Hoc Wireless Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
A framework for MAC protocol misbehavior detection in wireless networks
Proceedings of the 4th ACM workshop on Wireless security
Mobile Networks and Applications - Special issue: Wireless mobile wireless applications and services on WLAN hotspots
Trust model for certificate revocation in ad hoc networks
Ad Hoc Networks
Revocation games in ephemeral networks
Proceedings of the 15th ACM conference on Computer and communications security
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
Security and Cooperation in Wireless Networks: Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing
The fable of the bees: incentivizing robust revocation decision making in ad hoc networks
Proceedings of the 16th ACM conference on Computer and communications security
New strategies for revocation in ad-hoc networks
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Bridging game theory and cryptography: recent results and future directions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Security in mobile ad hoc networks: challenges and solutions
IEEE Wireless Communications
SCAN: self-organized network-layer security in mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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.