Determining parameters of key predistribution schemes via linear codes in wireless sensor networks

Authors:
Qi Chen;Dingyi Pei;Junwu Dong
Affiliations:
College of Mathematics and Information Science, Guangzhou University, Guangzhou, China;College of Mathematics and Information Science, Guangzhou University, Guangzhou, China;College of Mathematics and Information Science, Guangzhou University, Guangzhou, China
Venue:
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Year:
2010

Citing 14
Cited 0

A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
On Some Polynomials Related to Weight Enumerators of Linear Codes

SIAM Journal on Discrete Mathematics
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
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design

International Journal of Information Security - Special issue on ISC'05
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs

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
Key Predistribution Schemes Using Codes in Wireless Sensor Networks

Information Security and Cryptology
On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Product construction of key distribution schemes for sensor networks

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In INSCRYPT 2008, Ruj and Roy proposed deterministic key predistribution schemes using codes. Particularly, they used Reed Solomon codes to present key predistribution schemes. They calculate the connectiviey and resiliency of the network when the schemes are based on Reed Solomon codes. However, the connectivity and resiliency of the network for the schemes using other codes haven't been calculated so far. In the present paper, we will determine the key parameters of predistribution schemes via linear codes in wireless sensor networks. We calculate the connective probability, the probability fail(1) and the upper bound of the fraction of links broken when s nodes are compromised. We use the theory of matroid. We find that it is very surprising that these parameters can be calculated by making use of the chromatic polynomial of the matroid associated to the codes used in the resulting schemes.