一种新的基于辛空间的密钥预分配方案

密钥预分配是无线传感器网络中最具挑战的安全问题之一。 该文基于有限域上辛空间中子空间之间的正交关系构造了一个新的组合设计，并基于该设计构造了一个密钥预分配方案。令V 是有限域上8维辛空间中的一个(4,2)型子空间，V 中每一个(1,0)型子空间看作密钥预分配方案中的一个节点，所有的(2,1)型子空间看作该方案的一个密钥池。将整个目标区域划分为若干个大小相同的小区，每个小区有普通节点和簇头两种类型的传感器节点。小区内的普通节点采用基于辛空间的密钥预分配方案分发密钥，不同小区内节点所用密钥池互不相同，因此不同小区内的节点需通过簇头建立间接通信，不同小区内簇头采用完全密钥预分配方式分发密钥。与其他方案相比，该方案的最大优势是网络中节点的抗捕获能力较强，且随着网络规模的不断扩大，网络的连通概率逐渐趋于1。

A New Key Pre-distribution Scheme from Symplectic Spaces

Key pre-distribution is one of the most challenging security problems in wireless sensor networks. In the paper, a new combinatorial design based on the orthogonal relation between the subspaces of symplectic space over finite fields is constructed, and a key pre-distribution scheme is constructed from the design. Let V be a subspace of type (4,2) in an 8-dimensional symplectic space over finite fields. A subspace of type (1,0) in V is regarded as a node in the key pre-distribution scheme, and all the subspaces of (2,1) in V is regarded as the key pool of the scheme. The whole target area is divided into a number of equally sized cells, each cell has normal nodes and cluster heads two types nodes. The key pre-distribution scheme from symplectic space is adopted to distribute keys to nodes of each cell, and different cells has different key pools, so nodes in different cells need to establish indirect communication through the cluster heads, the cluster heads in different cells distribute keys in a complete key pre-distribution scheme. Compared with other schemes, the advantages of the proposed scheme is the strong anti-compromise ability of nodes in the networks, and with the continuous expansion of the network scale, the connectivity gradually tends to 1.