One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
SPINS: security protocols for sensor networks
Wireless Networks
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 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
Location-based pairwise key establishments for static sensor networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Performance aware tasking for environmentally powered sensor networks
Proceedings of the joint international conference on Measurement and modeling of computer systems
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
An efficient scheme for authenticating public keys in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
IEEE Transactions on Dependable and Secure Computing
Survey Bloom filter applications in network security: A state-of-the-art survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The sensors in a DMSNs are often used for forming logical groups within the network for performing collaborative tasks which need to ensure that sensors participating in the groups are legitimate and securely introduced in the group. This paper is built upon the unique integration of several cryptographic techniques. Based on the one-way accumulator, an efficient mechanism of node membership verification is proposed to handle joining of nodes in the groups in the network. Based on µ TESLA and bloom filter, an efficient mechanism is proposed to handle leaving of nodes in the groups in the network. This strategy does not require each node to maintain a membership list, does not require communication between the base station and verifying node, and it can efficiently handles dynamic membership events (node leaves and joins).