A Class of Key Predistribution Schemes Based on Orthogonal Arrays

被引:1
|
作者
董军武 [1 ,2 ]
裴定一 [2 ]
王学理 [3 ]
机构
[1] College of Mathematics and Econometrics, Hunan University
[2] Institute of Information Security, Guangzhou University
[3] School of Mathematical Sciences, South China Normal University
基金
中国国家自然科学基金;
关键词
sensor network; key predistribution scheme; combinatorial design; orthogonal array; Bush’s construction;
D O I
暂无
中图分类号
TP212.9 [传感器的应用];
学科分类号
摘要
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. In order to ensure this security, many approaches have been proposed recently. One of them is to use key predistribution schemes (KPSs) by means of combinatorial designs. In this paper, we use the Bush’s construction of orthogonal arrays to present a class of key predistribution schemes for distributed sensor networks. The secure connectivity and resilience of the resulting sensor network are analyzed. This KPS constructed in our paper has some better properties than those of the existing schemes.
引用
收藏
页码:825 / 831
页数:7
相关论文
共 50 条
  • [41] Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes
    Henry, Kevin
    Paterson, Maura B.
    Stinson, Douglas R.
    SELECTED AREAS IN CRYPTOGRAPHY - SAC 2013, 2014, 8282 : 89 - 117
  • [42] Authentication and Key Establishment in WSN Based on Key Predistribution
    Shenets, N. N.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2022, 56 (08) : 947 - 956
  • [43] Bidirectional hash chains generically enhances resilience of key predistribution schemes
    Kumar Dalai, Deepak
    Sarkar, Pinaki
    IET WIRELESS SENSOR SYSTEMS, 2020, 10 (04) : 154 - 165
  • [44] A class of key-node indexed hash chains based key predistribution (KPS): Signed weighted graphs
    Sarkar, Pinaki
    Nandi, Sukumar
    COMPUTER NETWORKS, 2019, 164
  • [45] A class of nearly orthogonal arrays
    Lu, X
    Li, W
    Xie, M
    JOURNAL OF QUALITY TECHNOLOGY, 2006, 38 (02) : 148 - 161
  • [46] Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays
    Wocjan, Pawel
    PHYSICAL REVIEW A, 2006, 73 (06):
  • [47] Minimum Node Degree and κ-connectivity for Key Predistribution Schemes and Distributed Sensor Networks
    Wu, Jiang
    Stinson, Douglas R.
    WISEC'08: PROCEEDINGS OF THE FIRST ACM CONFERENCE ON WIRELESS NETWORK SECURITY, 2008, : 119 - 124
  • [48] k-Connectivity in Random Graphs induced by Pairwise Key Predistribution Schemes
    Sood, Mansi
    Yagan, Osman
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1343 - 1348
  • [49] Key Predistribution Schemes for Establishing Pairwise Keys with a Mobile Sink in Sensor Networks
    Rasheed, Amar
    Mahapatra, Rabi N.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (01) : 176 - 184
  • [50] Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes
    Chen, Hao
    Ling, San
    Padro, Carles
    Wang, Huaxiong
    Xing, Chaoping
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2009, 5921 : 263 - +