An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A matrix key-distribution scheme
Journal of 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
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
ACM Transactions on Information and System Security (TISSEC)
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Efficient key establishment for group-based wireless sensor deployments
Proceedings of the 4th ACM workshop on Wireless security
Group-based key pre-distribution in wireless sensor networks
Proceedings of the 4th ACM workshop on Wireless security
Location dependent key management using random key-predistribution in sensor networks
WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
| Hi-index | 0.00 |
This study is to investigate new schemes for distributing cryptographic keys in sensor networks. Sharing a key is the very first step to realize secure communication over an untrusted network infrastructure, but commonly used cryptographic techniques cannot be employed for sensor networks due to the restriction of computational resources of sensor nodes. A practical solution to this issue is to predistribute cryptographic keys in sensor nodes before they are deployed. A focal point in this solution is the choice of keys that are assigned to a sensor node. Eschenauer et al. considered to choose keys randomly, and Chan et al. also followed the random choice approach. We consider in this paper a new approach in which keys are assigned according to a basic algebraic geometry. The performance of the proposed scheme is investigated analytically.