EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A new family of authentication protocols
ACM SIGOPS Operating Systems Review
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Key Infection: Smart Trust for Smart Dust
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
The Economics of Resisting Censorship
IEEE Security and Privacy
Distributed Detection of Node Replication Attacks in Sensor Networks
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
On the Distribution and Revocation of Cryptographic Keys in Sensor Networks
IEEE Transactions on Dependable and Secure Computing
An RFID Distance Bounding Protocol
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Suicide for the common good: a new strategy for credential revocation in self-organizing systems
ACM SIGOPS Operating Systems Review
Using New Tools for Certificate Repositories Generation in MANETs
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
Trust management for secure information flows
Proceedings of the 15th ACM conference on Computer and communications security
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
A certificate revocation scheme for space network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
OREN: Optimal revocations in ephemeral networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient public key certificate management for mobile ad hoc networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Game theory meets network security and privacy
ACM Computing Surveys (CSUR)
Cooperative security in distributed networks
Computer Communications
BECSI: Bandwidth efficient certificate status information distribution mechanism for VANETs
Mobile Information Systems
Hi-index | 0.00 |
Responding to misbehavior in ad-hoc and sensor networks is difficult. We propose new techniques for deciding when to remove nodes in a decentralized manner. Rather than blackballing nodes that misbehave, a more efficient approach turns out to be reelection - requiring nodes to secure a majority or plurality of approval from their neighbors at regular intervals. This can be implemented in a standard model of voting in which the nodes form a club, or in a lightweight scheme where each node periodically broadcasts a 'buddy list' of neighbors it trusts. This allows much greater flexibility of trust strategies than a predetermined voting mechanism. We then consider an even more radical strategy still - suicide attacks - in which a node on perceiving another node to be misbehaving simply declares both of them to be dead. Other nodes thereafter ignore them both. Suicide attacks, found in a number of contexts in nature from bees to helper T-cells, turn out to be more efficient still for an interesting range of system parameters.