Determining Parameters of Key Predistribution Schemes via Linear Codes in Wireless Sensor Networks

被引：0
|
作者：
Chen, Qi [1 ]
Pei, Dingyi [1 ]
Dong, Junwu [1 ]
机构：
[1] Guangzhou Univ, Coll Math & Informat Sci, Guangzhou 510006, Guangdong, Peoples R China
来源：
INFORMATION SECURITY AND CRYPTOLOGY | 2011年 / 6584卷
关键词：
Key predistribution scheme; Combinatorial design; Linear code; Matroid; Sensor network; DESIGNS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In INSCRYPT 2008, Raj 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.
引用
收藏
页码：284 / 299
页数：16
相关论文
共 50 条
  • [21] Dynamic Resiliency Analysis of Key Predistribution in Wireless Sensor Networks
    Durahim, Ahmet Onur
    Levi, Albert
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 977 - 982
  • [22] A General Pairwise Key Predistribution Scheme for Wireless Sensor Networks
    DING Xiaoyu1
    2. Department of Basical Courses
    WuhanUniversityJournalofNaturalSciences, 2008, (06) : 744 - 748
  • [23] On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks
    Martin, Keith M.
    CODING AND CRYPTOLOGY, PROCEEDINGS, 2009, 5557 : 124 - 145
  • [24] Intragroup and Intergroup Pairwise Key Predistribution for Wireless Sensor Networks
    Yang, Ching-Nung
    Gu, Ting-Song
    You, Jhou-Cian
    Wang, Chang-Ji
    SENSORS, 2025, 25 (01)
  • [25] Group-based key predistribution for wireless sensor networks
    Liu, Donggang
    Ning, Peng
    Du, Wenliang
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2008, 4 (02)
  • [26] Analysis of Latency in Secure Wireless Sensor Networks with Key Predistribution
    Subramanian, Ramanan
    Chan, Kevin
    Fekri, Faramarz
    2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, : 2120 - 2124
  • [27] Scaling Laws of Key Predistribution Protocols in Wireless Sensor Networks
    Gu, Wenjun
    Chellappan, Sriram
    Bai, Xiaole
    Wang, Honggang
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2011, 6 (04) : 1370 - 1381
  • [28] New pairwise key predistribution scheme for wireless sensor networks
    School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China
    Beijing Hangkong Hangtian Daxue Xuebao, 2009, 9 (1080-1082+1087):
  • [29] Tree-based key predistribution for wireless sensor networks
    Jooyoung Lee
    Daesung Kwon
    Wireless Networks, 2009, 15 : 1140 - 1151
  • [30] A collusion attack on pairwise key predistribution schemes for distributed sensor networks
    Moore, T
    FOURTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS, 2006, : 251 - +
12345