A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th 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
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Improving key predistribution with deployment knowledge in static sensor networks
ACM Transactions on Sensor Networks (TOSN)
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks
ACM Transactions on Sensor Networks (TOSN)
Efficient Hybrid Security Mechanisms for Heterogeneous Sensor Networks
IEEE Transactions on Mobile Computing
Combinatorial design of key distribution mechanisms for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Many existing pairwise key establishment in sensor networks were developed based on the polynomial-based method. However, this method cannot offer the basic authentication function of security. In this paper, we develop a novel tame-based approach to achieve the goal of authentication. We then present a general framework, for pairwise key establishment, in the basis of this tame-based approach. It turns out that this tame map can substitute the polynomial in any existing polynomial pool-based scheme to offer the authentication service. In particular, we further introduce a new scheme, local symmetric-tame maps predistribution scheme, based on this framework. The analysis demonstrates that, in addition to being able to provide authentication service, this scheme not only has significantly better performance, but also can achieve greater resilience on security than existing schemes.