SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Denial of Service in Sensor Networks
Computer
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Generating RSA Keys on a Handheld Using an Untrusted Server
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Proceedings of the 7th International Workshop on Security Protocols
Energy-Aware Target Localization in Wireless Sensor Networks
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
IEEE Network: The Magazine of Global Internetworking
Configurable Security Protocols for Multi-party Data Analysis with Malicious Participants
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the security of wireless sensor networks
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
Distributed sensor networks are a promising technology for surveillance and reconnaissance in many applications, such as next generation C4ISR and the digital battlefield. The dearth of effective security mechanisms are a main obstacle to the acceptance of distributed sensor networks. As research pushes sensor nodes to be smaller and ubiquitotts, security issues become paramount. Security in sensor networks needs to be considered during the early phases of development. This paper describes a decentralized solution to the problem of securely checking node membership in ad hoc sensor networks. This method does not require each node to maintain a membership list, does not require communication between the base station and verifying node, and it efficiently handles dynamic membership events (node leaves and joins). It is based on the concept of quasi-commutative hash functions, also called one-way accumulators. The paper analyzes resource requirements and suggests new ways to optimize the use of one-way accumulators while maintaining security in sensor node applications.