Key Predistribution Schemes Based on Orthogonal Arrays with Unique Hamming Distance Distribution

With the deep study of the Hamming distances of orthogonal arrays (OAs), the application of OAs has penetrated into many fields, one of which is to construct the key predistribution schemes (KPSs) for distributed sensor networks. In this paper, we define the Hamming distance distribution (HDD) of an OA and its uniqueness. Furthermore, we present some OAs with unique HDD. In KPSs based on these OAs, the calculations of metrics for evaluating connectivity and resilience can be simplified. We also illustrate that KPSs based on them have a wider application and better connectivity and resilience than the existing ones.

[1]  Dingyi Pei,et al.  A Class of Key Predistribution Schemes Based on Orthogonal Arrays , 2008, Journal of Computer Science and Technology.

[2]  S. Pang,et al.  Schematic saturated orthogonal arrays obtained by using the contractive replacement method , 2017 .

[3]  Bülent Yener,et al.  Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks , 2004, ESORICS.

[4]  S. Pang,et al.  Construction of Symmetric and Asymmetric Orthogonal Arrays of Strength t from Orthogonal Partition , 2018, Indian Journal of Pure and Applied Mathematics.

[5]  Rahul Mukerjee,et al.  On the existence of saturated and nearly saturated asymmetrical orthogonal arrays , 1995 .

[6]  Douglas R. Stinson,et al.  Common intersection designs , 2006 .

[7]  Lu Yiqiang,et al.  ORTHOGONAL ARRAYS OBTAINED BY ORTHOGONAL DECOMPOSITION OF PROJECTION MATRICES , 1999 .

[8]  Douglas R. Stinson,et al.  On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs , 2008, TSEC.

[9]  S. Pang,et al.  Generalized latin matrix and construction of orthogonal arrays , 2017 .

[10]  P. Delsarte.  AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .

[11]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[12]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[13]  Douglas R. Stinson,et al.  A unified approach to combinatorial key predistribution schemes for sensor networks , 2014, IACR Cryptol. ePrint Arch..

[14]  Keith M. Martin,et al.  On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks , 2009, IWCC.

[15]  Xueli Wang,et al.  A Key Predistribution Scheme Based on 3-Designs , 2007, Inscrypt.

[16]  Jing Wang,et al.  Construction and count of 1-resilient rotation symmetric Boolean functions , 2018, Inf. Sci..

[17]  Aloke Dey,et al.  Key predistribution schemes for distributed sensor networks via block designs , 2013, Des. Codes Cryptogr..

[18]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[19]  Chunming Rong,et al.  A novel key pre-distribution scheme for wireless distributed sensor networks , 2010, Science China Information Sciences.

[20]  Changbao Wu,et al.  An Approach to the Construction of Asymmetrical Orthogonal Arrays , 1991 .

[21]  Wilfrid S. Kendall,et al.  A Generalised Formula for Calculating the Resilience of Random Key Predistribution Schemes , 2012, IACR Cryptol. ePrint Arch..

[22]  Yong Lin Zhang.  On Schematic Orthogonal Arrays of Strength Two , 2009, Ars Comb..

[23]  S. S. Shrikhande,et al.  Generalized Hadamard Matrices and Orthogonal Arrays of Strength Two , 1964, Canadian Journal of Mathematics.

[24]  K. A. Bush.  Orthogonal Arrays of Index Unity , 1952 .

[25]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[26]  Qiang Gao,et al.  A Key Predistribution Scheme Based on Mixed-level Orthogonal Arrays , 2017, Ad Hoc Sens. Wirel. Networks.

[27]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[28]  A. S. Hedayat,et al.  On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2 , 1997 .

[29]  Sushmita Ruj,et al.  Key Predistribution Using Partially Balanced Designs in Wireless Sensor Networks , 2007, ISPA.

[30]  Qiang Gao,et al.  Key predistribution schemes for wireless sensor networks based on combinations of orthogonal arrays , 2018, Ad Hoc Networks.

[31]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

[32]  Douglas R. Stinson,et al.  A combinatorial approach to key predistribution for distributed sensor networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.