Abstract: This paper focuses on key pre-distribution, a foundational problem of security in wireless sensor networks. A novel key pre-distribution scheme named sBIBD\-Hadamard KPS was devised by authors based on combinatorial designs technique. The essence of sBIBD\-Hadamard KPS is constructing symmetric balanced incomplete block design with Hadamard matrix and mapping it to a key pre-distribution scheme. The derivation and data illuminated that sBIBD\-Hadamard KPS and its extended versions improvement themselves than the most scheme in existence, mainly on three facets. First, sBIBD\-Hadamard KPS make the pair sensor nodes to share common keys at a higher sharing probability with the same key chain size, and achieved a smaller average key path length, especially to do all of that without asking for a node neighbor degree more than 2. Second, sBIBD\-Hadamard KPS make the pair sensor nodes to share more than one keys, and by carrying out a particular method to compositing the common key in time, it enhanced the security by enlarged the key space in the face of attacks using key analyzing. Finally, sBIBD\-Hadamard KPS upgrade itself to support many more nodes by two means named complementary set design and key slicing, and optimize the energy expenditure at the same time.