Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
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)
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)
Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. J. of the ACM. 33(4), 792–807 (1986)
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)
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)
Erods, P., Renyi, A.: On Random Graph. Publications Mathematicae, 290-297 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, J.S., Sadi, M.G., Kim, D.S., Song, Y.D. (2006). A Novel Pairwise Key Predistribution Scheme for Ubiquitous Sensor Network. In: Burmester, M., Yasinsac, A. (eds) Secure Mobile Ad-hoc Networks and Sensors. MADNES 2005. Lecture Notes in Computer Science, vol 4074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11801412_2
Download citation
DOI: https://doi.org/10.1007/11801412_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36646-1
Online ISBN: 978-3-540-37863-1
eBook Packages: Computer ScienceComputer Science (R0)