A Novel Pairwise Key Predistribution Scheme for Ubiquitous Sensor Network

  • Jong Sou Park
  • Mohammed Golam Sadi
  • Dong Seong Kim
  • Young Deog Song
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4074)


Secure communication is an open challenge for Ubiquitous Sensor Network (USN) collecting valuable information. Sensor nodes have highly constrained resources like limited battery power, memory, processing capabilities etc. These Limitations make infeasible to apply traditional key management techniques such as public key cryptography or other complex cryptographic techniques in the USN. Based on polynomial key pre-distribution protocol, we propose a novel key predistribution technique to establish a pairwise key between sensors. In our scheme, we adopt the Probabilistic Randomness concept on the basis of Grid Based Scheme in a way to achieve improved resiliency over large number of node compromise compared to the existing key predistribution schemes. Beside substantial improved resiliency, it also provides high probability and efficiency in establishing pairwise keys both in direct or path discovery method. Security analysis shows the effectiveness of our scheme in terms of resiliency improvement with little additional overheads in memory and communication.


Sensor Node Bivariate Polynomial Node Capture Ubiquitous Sensor Network Setup Server 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)Google Scholar
  2. 2.
    Chan, H., Perrig, A., Song, D.X.: Random Key Predistribution Schemes for Sensor Networks. In: Proc. of the 2003 IEEE Sym. on Security and Privacy, p. 197 (2003)Google Scholar
  3. 3.
    Du, W., Deng, J., Han, S.Y., Varshney, P.K.: Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks. In: Proc. of the 10th ACM conf. on Computer and Communications Security, pp. 42–51 (2003)Google Scholar
  4. 4.
    Eschenauer, L., Gligor, V.D.: A Key-Management Scheme for Distributed Sensor Networks. In: Proc. of the 9th ACM Conf. on Computer and Communications Security, pp. 41–47 (2002)Google Scholar
  5. 5.
    Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. J. of the ACM. 33(4), 792–807 (1986)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Gupta, V., Millard, M., Fung, S., Zhu, Y., Gura, N., Eberle, H., Shantz, S.C.: Sizzle: A Standards-Based End-to-End Security Architecture for the Embedded Internet. In: Proc. of 3rd IEEE Int. Conf. on Pervasive Computing and Communications, pp. 247–256 (2005)Google Scholar
  7. 7.
    Liu, D., Ning, P.: Establishing Pairwise Keys in Distributed Sensor Networks. In: Proc. of the 10th ACM Conf. on Computer and Communications Security, pp. 52–61 (2003)Google Scholar
  8. 8.
    Erods, P., Renyi, A.: On Random Graph. Publications Mathematicae, 290-297 (1959)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jong Sou Park
    • 1
  • Mohammed Golam Sadi
    • 1
  • Dong Seong Kim
    • 1
  • Young Deog Song
    • 2
  1. 1.Computer Engineering DepartmentHankuk Aviation UniversityKorea
  2. 2.Department of Information Security EngineeringHanseo UniversityKorea

Personalised recommendations