On the Analysis of k-Secure t-Conference Key Distribution Scheme
Ching‐Nung Yang, Jianming Li, Yung-Shun Chou · 2017
The k-Secure t-Conference key distribution scheme (kStC-KDS) provides dynamic conferences in wireless sensor networks, which any group of t sensor nodes can derive a conference key using only its pre-distributed piece in sensor nod concept is based on a t-variate symmetric polynomial of degree k. However, the storage size of each sensor node is exponentially proportional to the size of group. Recently, Harn and Hsu used the multiplication of t onevariate polynomials of degree k instead to reduce the storage size, but the dealer should prepare various (t-1) polynomials of degree k for each sensor node. It is observed that we only need to store the polynomial terms with various coefficients for this t-variate k-degree symmetric polynomial in Blundo and De Santis's kStCKDS. Although the number of polynomial terms with various coefficients is known from the multiset concept. In this work, we adopt partition problem to precisely determine all polynomial terms, such that we can figure out which polynomial terms should be stored in each sensor node to reduce storage size.