Browse > Article
http://dx.doi.org/10.6109/JKIICE.2009.13.11.2479

A study on Public Key Authentication using Polynomial Secret Sharing in WSN  

Kim, Il-Do (해군사관학교)
Kim, Dong-Cheon (해군사관학교)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.13, no.11, 2009 , pp. 2479-2487 More about this Journal
Abstract
Earlier researches on Sensor Networks preferred symmetric key-based authentication schemes in consideration of limitations in network resources. However, recent advancements in cryptographic algorithms and sensor-node manufacturing techniques have opened suggestion to public key-based solutions such as Merkle tree-based schemes. This paper proposes a new concept of public key-based authentication using Polynomial Secret Sharing that can be effectively applied to sensor networks and a detection of malicious node using the hash function. This scheme is based on exponential distributed data concept, a derivative from Shamir's (t,n) threshold scheme, in which the authentication of neighbouring nodes are done simultaneously while minimising resources of sensor nodes and providing network scalability.
Keywords
sensor network; public key-based authentication; Shamir's (t,n) threshold scheme;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Dirk Balfanz, D. K. Smetters, Paul Stewart and H. Chi Wemg, "Talking To Stranger: Authenticatiem in Ad-Hoc WIreless Networks", In Proceedings of the Network and Distributed System Security Symposium 2002, 2002
2 T. El Gamal, "A public key cryptooystem and a signature scheme based on discrete logarithms", IEEE Trans. Inform. Theory, 31:469-472, 1985   DOI
3 Y. Desmedt. "Society and group oriented cryptography: a new concept", In C. Pomerance, editor, Advances in cryptology, Proc. of Crypto'87(Lecture Notes in computer Science 293), pages 120-127. Springer-Verlag, 1988. Santa Barbara, california, U.S.A., August 16-20
4 Y. Desmedt and Y. Frankel, "Threshold cryptosystems", in Advances in Cryptology - Crypto '89, Proceedings, Lecture Notes in Computer Science 435, G. Brassard, Ed., Santa Barbara: Springer-Verlag, 1990, pp. 307-315
5 W. Diffie and M E. Helhnan, "New directions in cryptography", IEEE Trans. Inform Theory, IT-22(6); 644-654, November 1976
6 Wenliang Du, Ronghua Wang, and Peng Ning, "An Efficient Scheme for Authenticating Public Keys in Sensor Networks", 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc),2005
7 Srdjan CapkLm, Levente Buttyan and Jean-Pierre Hubaux, "Small Worlds in Security Systems; an Analysis of the pop Certificate Graph", In Proceedings of the ACM New Security Paradigms Workshop 2002, pp.2, 2002
8 A Shamir, "How to share a secret", Commun. ACM, 22:612-613, November 1979   DOI   ScienceOn
9 G. Gaubatz, J. Kaps, and B. Sunar, "Public keys cryptography in sensor networks - revisited", In The Proceedings of the 1st European Workshop on Security in Ad-Hoc and Sensor Networks (ESAS), 2004