Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

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

무선센서네트워크에서 다항식 비밀분산을 이용한 공개키 인증방식에 관한 연구

  • Published : 2009.11.30
Download PDF
⟨ Previous Next ⟩

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.

센서네트워크의 인증과 관련된 초기의 연구에서는 센서노드의 자원제약적인 특징을 고려하여 대칭키 기반의 인증 방식이 주로 제안되었으나, 최근에는 암호알고리즘의 성능이 개선되고 센서노드의 제조기술이 발달하여 Merkle 트리 방식 등 공개키 기반의 인증 방식도 제안되고 있다. 따라서 본 연구에서는 센서네트워크에 효과적으로 적용될 수 있는 새로운 개념의 다항식 비밀분산을 이용한 공개키 인증방식을 제안하며, hash 함수를 이용한 악의적 노드탐지 기법도 제안한다. 제안된 인증방식은 Shamir의 임계치 기법에 변형된 분산정보의 일종인 지수(exponential) 분산정보 개념을 적용하여 동시에 주변 노드들을 인증하면서 센서노드의 자원을 최소로 사용하고 네트워크의 확장성을 제공한다.

Keywords

References

  1. 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
  2. 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
  3. 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
  4. 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
  5. 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
  6. A Shamir, "How to share a secret", Commun. ACM, 22:612-613, November 1979 https://doi.org/10.1145/359168.359176
  7. T. El Gamal, "A public key cryptooystem and a signature scheme based on discrete logarithms", IEEE Trans. Inform. Theory, 31:469-472, 1985 https://doi.org/10.1109/TIT.1985.1057074
  8. 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
  9. W. Diffie and M E. Helhnan, "New directions in cryptography", IEEE Trans. Inform Theory, IT-22(6); 644-654, November 1976