• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.2181-2184
• /
• 2003

전자상거래, Single Sign On, 전자문서교환 등 웹 기반의 사이버 교환이 급증하는 오늘날 상대방의 신뢰를 보증해 줄 수 있는 수단으로 인증서의 사용이 필수적이다. 인증서는 인증기관을 신뢰한다는 가정에서 사용되기 때문에 통신개체 사이에서 보다 정확한 인증이 필요하다. 본 논문에서는 공개키 기반구조에서 인증서를 사용하는 모든 암호시스템 분야에 응용될 수 있는 인증 및 키 복구 메커니즘을 설계하였다. 서버와 사용자간에 인증서를 기반으로 공개키 암호에 의한 인증과 세션 암호 키 분배, 그리고 응용 자원서버들과의 비밀통신에서 암호 키의 유실을 고려한 키 복구 지원 프로토콜을 제안하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.11-20
• /
• 2008

Three-party key exchange protocol is a cryptographic protocol which permits two clients share a common session key using different passwords by the help of a trusted server. In a three-party key exchange protocol, an user remember only one password which shared with a trusted server for establish a common key with another user. The trusted server should participate in an execution of the protocol between two clients. This impose heavy burden on the server when many users want to establish a session key using the protocol. In this paper, we propose a three-party key exchange protocol based on a smart card which reduce the computational complexity and communication overhead for the trusted server. In our protocol, the server does not participate in an key exchange procedure between two clients.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.324-332
• /
• 2002

We design authentication protocols for wireless internet not using certificates but using passwords. The target protocols include WTLS and the certificate request protocol in the wireless PKI(Public Key Infrastructure). When a password based protocol is designed and implemented for authentication and key exchange, care mutt be taken of the short length and of the not-so-randomness of passwords. To frustrate the offline guessing attack that makes use of those weaknesses, our two protocols are dependent on the password based authentication protocol that has security proof. In this paper, how to design systematically the security protocols for authentication and key exchange using passwords is presented, and the methodology hopes to be useful in some other area that needs authentication using passwords.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.73-92
• /
• 2005

Joux's tripartite key agreement protocol is one of the most prominent developments in the area of key agreement. Although certificate-based and ID-based authentication schemes have been proposed to provide authentication for Joux's protocol, no provably secure password-based one round tripartite key agreement protocol has been proposed yet. We propose a secure one round password-based tripartite key agreement protocol that builds on Joux's protocol and adapts PAK-EC scheme for password-based authentication, and present a proof of its security.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.879-886
• /
• 2006

In this paper, we proposed an advanced authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. We simulated and compared the authentication structure proposed by Sufatrio, K. Lam[4] and the our authentication structure in terms of the authentication time. Simulation results show that the proposed method reduces the authentication time comparing to the conventional wireless PKI authentication method.

• Review of KIISC
• /
• v.7 no.3
• /
• pp.77-98
• /
• 1997

암호화 기술의 확장성 측면에서 우수한 공개키 기반 하부구조(Public Key Infrastructure)는 전자 상거래 서비스에서 필요한 제반 인증 기술을 제공하고 있다. 공개키를 보증하는 기반 기술과 인증서의 안전한 사용 기술은 공개키 기반 전자 상거래의 기본 기술이다. 이러한 기본 기술 중에는 키 복구(Key Recovery) 및 비밀 분산(Secret Sharing) 기술이 포함되며 인증기관(Certificate Authority : CA)을 통한 키 관리 효율성 및 인증기관과 서비스 사용자간의 안전한 정보 교환 기술이 또한 요구된다. 본 논문에서는 인터넷 기반의 전자 상거래 시 사용되는 공개키 기반의 인증구조에 대하여 검토 분석한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.123-132
• /
• 2005

In this paper, a conventional key exchange method simply Performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Proposed hand-over method shows reduced hand-over processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in authentication waiting time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.485-487
• /
• 2003

본 논문에서는 간단하고 효율적인 상호 인증 가능한 키 교환 프로토콜을 제안한다. 제안한 프로토콜은 두 참여들 사이에 미리 공유된 사람이 기억할 수 있는 패스워드를 이용하여 세션키를 교환하고 서로를 인증한다. 우리는 제안한 프로토콜이 중간 침입자 공격과 패스워드 추측 공격에 안전하고 완전한 전방향 보안성을 제공함을 보여준다. 즉, 제안한 프로토콜은 수동적인 공격자나 적극적인 공격자의 공격들에 안전하다. 제안된 프로토콜의 안정성은 이산대수 문제와 Diffie-Hellman 문제의 어려움에 기반을 두고 있다. 제안된 프로토콜은 구성이 간단하고 효율적이어서 소프트웨어나 하드웨어로 구현하기가 용이할 것으로 기대된다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.211-220
• /
• 2003

본 논문은 신뢰 할 수 없는 네트워크를 통해서도 사용자를 인증하거나 키를 교환하는 것에 적합한 패스워드 인증 프로토콜을 제안한다. 기본 아이디어는 패스워드 검증정보의 램덤성(randomness)을 증가시키기 위하여, 패스워드를 분할한 후 이에 대한 각 패스워드 지식을 확대(amplification)하는 구조로 설계된다. 또한 서버측 파일을 암호화하여 보관함으로써 서버 파일 타협 공격에 강인하도록 구성하였다. 더불어 검증정보 및 서버의 암호화키가 다수의 서버들에게 분산되도록 설계된 방식을 제안한다.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.949-958
• /
• 2005

In the paper we study key agreement schemes when a party needs to establish a session key with each of several parties, thus having multiple session keys. This situation can be represented by a graph, tailed a key graph, where a vertex represents a party and an edge represents a relation between two parties sharing a session key. graphs to establish all session keys corresponding to all edges in a key graph simultaneously in a single session. A key agreement protocol of a key graph is a natural extension of a two-party key agreement protocol. We propose a new key exchange model for key graphs which is an extension of a two-party key exchange model. using the so-called randomness re-use technique which re-uses random values to make session keys for different sessions, we suggest two efficient key agreement protocols for key graphs based on the decisional Diffie-Hellman assumption, and prove their securities in the key exchange model of key graphs. Our first scheme requires only a single round and provides key independence. Our second scheme requires two rounds and provides forward secrecy. Both are proven secure In the standard model. The suggested protocols are the first pairwise key agreement protocols and more efficient than a simple scheme which uses a two-party key exchange for each necessary key. Suppose that a user makes a session key with n other users, respectively. The simple scheme's computational cost and the length of the transmitted messages are increased by a factor of n. The suggested protocols's computational cost also depends on n, but the length of the transmitted messages are constant.