Parameter analysis of Blom’s key distribution dynamic scheme

Seyed Pouria Zahraei


Matrix schemes of preliminary key distribution are considered in the paper, they are constructed on the basis of the Blom scheme. Such schemes are used, in particular, in wireless sensor networks and allow effectively changing secret key parameters of a trusted center (TC) when the keys of certain protocol participants are compromised.

The paper presents a modernized Blom matrix scheme. It is assumed that the TC selects an N × N matrix P over a finite field GF (q), where N is the size of the network and q> N. Then, depending on the value of the security parameter t, the first t + 1 rows of the matrix P are taken as an open matrix. The matrix P is public, and it is assumed that any system of t + 1 columns to this matrix is linearly independent. In addition, it is assumed that the TC generates a random (t + 1) × (t + 1) symmetric secret matrix S over GF (q), 16S=X*XT , X is a random matrix of size (t + 1) × (t +1), and computes the matrix 16A=(S.P)T .

If nodes i and j need to set a common key, they first exchange columns from the matrix P and then compute 16Kij  and 16Kji , respectively, using the secret rows of the matrix A.

The probability of coincidence of keys for different pairs of participants is calculated.

Based on the program implementation, the results of computational experiments are presented. In particular, the dependence of the probability of coincidence of the keys of two participants on the protocol parameters (the size of the field and the number of participants) was established experimentally. For q = 1009, the number of key matches for different N values was obtained. Also, the results for the value of N were obtained on the assumption that the maximum of coincidences should be equal to 5.

Full Text:

PDF (Russian)



. S.Sukumar Computational Analysis of Modified Blom's Scheme.

. A. P. ALFEROV, A. Ju, ZUBOV, A. S. KUZ''MIN, A. V. ChEREMUShKIN. Osnovy Kriptografii. M. 2005. S. 390-394.

. R. Blom, An Optimal Class Of Symmetric Key Generation Systems. Ericsson Radio Systems, Stockholm, Sweden, 1985.

. A.Parakh and S. Kak, Efficient key management in sensor networks. Proceedings IEEE GLOBECOM workshops (GC workshops). pp. 1539–1544, 2010.

. A.Parakh and S. Kak, Matrix based key agreement algorithms for sensor networks. Proceedings IEEE 5th International Conference on Advanced Networks and Telecommunication Systems (ANTS), pp. 1–3, 2011.

. W. Du, J. Deng, Y S. Han, P. Varshney, J. Katz, and A. Khalili. A pairwise key pre- distribution scheme for wireless sensor networks. ACM Transactions on Information and System Security (TISSEC), 2005.

. D. Liu, P. Ning, and R. Li. Establishing pairwise keys in distributed sensor networks. ACM Trans. Inf Syst. Secur., 8:41-77, Oct 2005.

. A. Parakh and S. Kak, Online data storage using implicit security. Information Sciences, vol. 179, pp. 3323-3331, 2009.

. A. Parakh and S. Kak, Space efficient secret sharing for implicit data security. Information Sciences, vol. 181, pp. 335-341, 2011.

. G. J. Pottie and W. J. Kaiser. Wireless Integrated Network Sensors. Communications of the ACM, 43(5):51-58, 2000.

. R.S. Reddy, “Key management in wireless sensor networks using a modified Blom scheme”, arXiv: 1103.5712.

. Mee Loong Yang, Adnan Al-Anbuky and William Liu, An Authenticated Key Agreement Scheme for Wireless Sensor Networks


  • There are currently no refbacks.

Abava  Absolutech Fruct 2020

ISSN: 2307-8162