• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1003-1006
• /
• 2002

정보화 물결이 일반화 되어가고 있는 이 시점에 있어 컴퓨터 통신망의 중요성은 두 말 할 나위가 없다. 일반 가정에서는 일상생활의 지혜와 정보교환이 우선시되어지고, 기업 내에서는 문서 양식의 통폐합 및 간소화 뿐 만 아니라 기밀 사항이나 정보 교류가 일반화되어지고 있다. 하지만 문서의 결재방식에 있어서는 보안상의 문제점을 거론하며 번거로운 결재 방법을 이용하고 있다. 본 논문에서는 문서에 있어 전자결재의 순차적인 인증키 생성과 번거로운 인증 방식을 탈피하고자 그룹키를 생성하며. 그룹키를 이용한 단순하지만 보안상으로는 더욱 강력해진 방법을 제안하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.987-990
• /
• 2006

AAA(Authentication, Authorization, Accounting) 프로토콜은 기존의 유선망 뿐만 아니라 비약적으로 발전하고 있는 무선망에서 VoIP, Mobile IP 등과 같은 다양한 서비스 및 프로토콜 상에서 안전하고 신뢰성 있는 사용자 인증, 인가, 과금 기능을 체계적으로 제공하는 정보보호 기술이다. 그러나 현재 무선망은 유선망에 비해 외부로부터의 공격에 매우 취약하고 통신에 있어서 많은 제약사항이 뒤따르고 있다. 현재 IETF AAA 워킹그룹에서도 무선망에서의 안전한 AAA 프로토콜에 관하여 중요하게 다루고 있으며, 모바일 노드의 이동성에 따른 안전한 인증을 제공하는 방안에 대해서 활발히 연구 중이다. 따라서 본 연구에서는 모바일 노드가 홈 인증 서버로부터 인증을 받고 난 후에 외부 네트워크로 이동하더라도 홈 인증 서버로부터 발급받은 티켓을 이용하여 홈 인증 서버로 접근을 하지 않고 외부 네트워크에서의 인증을 제공하여 서비스를 받을 수 있게 한다. 본 방식은 티켓을 사용함으로써 교환되는 메시지 및 지연을 줄이고 지속적인 서비스를 제공받을 수 있어 효율성을 높일 수 있다.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.441-450
• /
• 2010

Recently, a lot of interest is increased in sensor network which gathers various data through many sensor nodes deployed in wired and wireless network environment. However, because of the limitation in memory, computation, and energy of the sensor nodes, security problem is very important issue. In sensor network, not only the security problem, but also computing power should be seriously considered. In this paper, considering these characteristics, we make the sensor network consist of normal sensor nodes and clusterheaders with enough space and computing power, and propose a group key rekeying scheme adopting PCGR(Predistribution and local Collaborationbased Group Rekeying) for secure group communication. In our proposal, we enhance the security by minimizing the risk to safety of the entire network through verifying the new key value from clusterheader by sensor nodes. That is, to update the group keys, clusterheaders confirm sensor nodes through verifying the information from sensor nodes and send the new group keys back to authentic member nodes. The group keys sent back by the clusterheaders are verified again by sensor nodes. Through this mutual authentication, we can check if clusterheaders are compromised or not. Qualnet simulation result shows that our scheme not only guarantees secure group key rekeying but also decreasesstorage and communication overhead.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.1
• /
• pp.3-10
• /
• 2013

Several identity-based and authenticated key agreement protocols have been proposed. It remains at issue to design secure identity based and authenticated key agreement protocols. In this paper, we propose a one round authenticated group key agreement protocol which uses one more key pair as well as the public key and private key of typical IBE(Identity-Based Encryption) system. The proposed protocol modified Shi et al.'s protocol and He et al.'s protocol. The public and private keys and the signature process of our protocol are simpler than them of their protocols. Our protocol is secure and more efficient than their protocols in communication and computation costs.

• Journal of Digital Convergence
• /
• v.12 no.2
• /
• pp.335-341
• /
• 2014

To play the networked video contents in a client's mobile device in real time, the contents should be delivered to it by the contents server with streaming technology. Generally, in a server-client based commerce model, the server is in charge of both the authentication of the paid customer and distribution of the contents. The drawback of it is that if the customers' requests go on growing rapidly, the service quality would be degraded results from the problems of overloaded server or restricted network bandwidth. On the contrary, in P2P based networks, more and more the demand for service increasing, the service quality is upgraded since a customer can act as a server. But, in the P2P based network, there are too many servers to manage, it's possible to distribute illegal contents because the P2P protocol cannot control distributed servers. Thus, it's not suitable for commercial purposes. In this paper, the dymanic group authentication scheme is proposed which is suited to P2P based applications. The proposed scheme consists of group based key generation, key update, signature generation and verification protocols. It can control the seeder's state whether the seeder is joining or leaving the network, and it can be applied to hybrid P2P based commerce model where sales transactions are covered by the index server and the contents are distributed by the P2P protocol.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.5
• /
• pp.103-113
• /
• 2008

Reducing handoff latency is essential in providing seamless multimedia service in Wireless LAN based on the IEEE 802.11 standard. Reducing authentication delay is critical in reducing handoff latency. To this end, several authentication protocols for fBst handoff have been proposed. Mishra et al. used proactive key distribution to improve the authentication delay incurred in the current standard and Park et al. proposed a new authentication protocol based on Blom's key pre-distribution scheme. In this paper, we propose an enhanced authentication protocol based on Bresson et al.'s group key protocol. If a mobile node has previously access the network, our proposed protocol only requires simple hash operations in providing mutual authentication between a mobile node and access points. Our protocol is more efficient than Park et al.'s and Mishra et al.'s technique can be used in our protocol to further enhance our protocol.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.59-69
• /
• 2004

Password-based authenticated group key exchange protocols provide a group of user, communicating over a public(insecure) channel and holding a common human-memorable password, with a session key to be used to construct secure multicast sessions for data integrity and confidentiality. In this paper, we present a password-based authenticated group key exchange protocol and prove the security in the random oracle model and the ideal cipher model under the intractability of the decisional Diffie-Hellman(DH) problem and computational DH problem. The protocol is scalable, i.e. constant round and with O(1) exponentiations per user, and provides forward secrecy.

• Information and Communications Magazine
• /
• v.33 no.12
• /
• pp.41-47
• /
• 2016

최근 사물인터넷에 대한 관심과 투자가 크게 증가하고 있으나 보안 측면에서 문제가 지속적으로 제기되고 있다. 그 해결책으로서 IETF ACE 워킹 그룹이 기존의 OAuth 2.0 기반으로 여러 제약적인 사물인터넷 환경에 적합한 새로운 보안 프레임워크인 ACE 프레임워크 표준을 제정 중에 있다. 본 고에서는 우선 OAuth 2.0 기반 사물인터넷 인증 프레임워크 연구 동향에 대해 소개하고, 새로운 OAuth 2.0 기반 CoAP 인증 프레임워크를 제안한다.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.495-498
• /
• 2010

본 논문에서는 외부 클라이언트가 홈 네트워크 시스템을 컨트롤 하기위하여 홈 네트워크의 보안요소 중 사용자 인증과 접근제어에 관하여 연구 하였으며 사용자 인증의 인증서는 X.509 v3의 인증서를 기반으로 사용하고 X.509 v3의 확장영역에 사용자의 그룹을 나누어 디바이스를 제어하고 접근이 제한된 디바이스는 ACL(Access Control List)을 추가하여 접근제어를 하는 방법으로 접근이 제한된 사용자와 이를 관리하는 관리자로 나누어 각 디바이스에 대한 접근제안과 외부 공격으로 부터의 안전하게 보호할 수 있게 제안한 논문이다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.1
• /
• pp.41-55
• /
• 2005

A group key agreement protocol allows a group of user to share a key which may later be used to achieve certain cryptographic goals. In this paper, we propose a new scalable two-round ID-based group key agreement protocol which would be well fit to a Pay-TV system, additionally. to the fields of internet stock quotes, audio and music deliveries, software updates and the like. Our protocol improves the three round poop key agreement protocol of Nam et al., resulting in upgrading the computational efficiency by using the batch verification technique in pairing-based cryptography. Also our protocol simplifies the key agreement procedures by utilizing ID-based system. We prove the security of our protocol under the Computational Diffie-Hellman assumption and the Bilinear Decisional Diffie-Hellman assumption. Also we analyze its efficiency.