摘要

Key pre-distribution based on combinatorial set systems has become an emerging area in recent past. Besides the existing key metrics, we evaluate sonic of the existing combinatorial schemes under selective capture of nodes. In this paper, we present a deterministic key pre-distribution based on finite projective planes with an objective to improve the scalability. From the view of improving the resilience against random node capture, a modification of the above approach is also presented. Key metrics of the resulting schemes is analyzed and have better properties than many of the existing key pre-distribution schemes.

  • 出版日期2012