• 한국정보통신학회논문지
• /
• 제13권11호
• /
• pp.2479-2487
• /
• 2009

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

• 한국군사과학기술학회지
• /
• 제11권5호
• /
• pp.58-70
• /
• 2008

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. These previous schemes, however, must perform the authentication process one-by-one in hierarchical manner and thus are not fit to be used as primary authentication methods in sensor networks which require mass of multiple authentications at any given time. This paper proposes a new concept of public key-based authentication that can be effectively applied to sensor networks. 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. The performance advantages of this scheme on memory usage, communication overload and scalability compared to Merkle tree-based authentication are clearly demonstrated using performance analysis.

• 한국멀티미디어학회논문지
• /
• 제17권8호
• /
• pp.953-960
• /
• 2014

In Shamir's (t,n)-threshold based secret image sharing schemes, there exists a problem that the secret image can be reconstructed when an arbitrary attacker becomes aware of t secret image pieces, or t participants are malicious collusion. It is because that utilizes linear combination polynomial arithmetic operation. In order to overcome the problem, we propose a secret image sharing scheme using matrix decomposition and adversary structure. In the proposed scheme, there is no reconstruction of the secret image even when an arbitrary attacker become aware of t secret image pieces. Also, we utilize a simple matrix decomposition operation in order to improve the security of the secret image. In experiments, we show that performances of embedding capacity and image distortion ratio of the proposed scheme are superior to previous schemes.