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 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
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Combinatorial Designs: Constructions and Analysis
Combinatorial Designs: Constructions and Analysis
A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
IEEE Transactions on Dependable and Secure Computing
Key Pre-Distribution Using MDS Codes in Mobile Ad Hoc Networks
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
ACM Transactions on Information and System Security (TISSEC)
A Key Predistribution Scheme Based on 3-Designs
Information Security and Cryptology
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Key predistribution using partially balanced designs in wireless sensor networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Determining parameters of key predistribution schemes via linear codes in wireless sensor networks
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
100% connectivity for location aware code based KPD in clustered WSN: merging blocks
ISC'12 Proceedings of the 15th international conference on Information Security
Code based KPD scheme with full connectivity: deterministic merging
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
| Hi-index | 0.00 |
In this paper we propose novel deterministic key predistribution schemes using codes. In particular we use Reed Solomon codes to present key predistribution scheme, which is better than existing schemes in terms of connectivity. We show that selective node compromise attack cannot be launched, because there is no clever way of knowing which nodes to compromise. An important advantage of our scheme is that we can increase the scalability of the network without redistributing keys in the existing nodes.