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

来源：

JournalofComputerScience&Technology | 2008年 / 05期

基金：

中国国家自然科学基金;

关键词：

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 条

[21] A Survey of Key Predistribution Schemes for Key Management in Wireless Sensor Networks
Manoj, R.
Dhinakaran, N.
RECENT ADVANCES IN NETWORKING, VLSI AND SIGNAL PROCESSING, 2010, : 135 - +
[22] A unified approach to combinatorial key predistribution schemes for sensor networks
Maura B. Paterson
Douglas R. Stinson
Designs, Codes and Cryptography, 2014, 71 : 433 - 457
[23] Graph-theoretic design and analysis of key predistribution schemes
Michelle Kendall
Keith M. Martin
Designs, Codes and Cryptography, 2016, 81 : 11 - 34
[24] How to Break LU Matrix Based Key Predistribution Schemes for Wireless Sensor Networks
Zhu, Bo
Zheng, Yanfei
Zhou, Yaowei
Chen, Kefei
2009 IEEE 6TH INTERNATIONAL CONFERENCE ON MOBILE ADHOC AND SENSOR SYSTEMS (MASS 2009), 2009, : 408 - 416
[25] A unified approach to combinatorial key predistribution schemes for sensor networks
Paterson, Maura B.
Stinson, Douglas R.
DESIGNS CODES AND CRYPTOGRAPHY, 2014, 71 (03) : 433 - 457
[26] Key predistribution schemes for sensor networks for continuous deployment scenario
Uenlue, Abduelhakim
Armagan, Oensel
Levi, Albert
Savas, Erkay
Ercetin, Oergur
NETWORKING 2007: AD HOC AND SENSOR NETWORKS, WIRELESS NETWORKS, NEXT GENERATION INTERNET, PROCEEDINGS, 2007, 4479 : 239 - +
[27] New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes
Kurosawa K.
Okada K.
Saido H.
Stinson D.R.
Designs, Codes and Cryptography, 1998, 15 (1) : 87 - 100
[28] Key Predistribution Schemes Using Codes in Wireless Sensor Networks
Ruj, Sushmita
Roy, Bimal
INFORMATION SECURITY AND CRYPTOLOGY, 2009, 5487 : 275 - 288
[29] New combinatorial bounds for authentication codes and key predistribution schemes
Des Codes Cryptography, 1 (87-100):
[30] Graph-theoretic design and analysis of key predistribution schemes
Kendall, Michelle
Martin, Keith M.
DESIGNS CODES AND CRYPTOGRAPHY, 2016, 81 (01) : 11 - 34

← 1 2 3 4 5 →