• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.974-987
• /
• 2005

As the ad hoc networks have been received a great deal of attention to not only the military but also the industry applications, some security mechanisms are required for implementing a practical ad hoc application. In this paper, we propose a security architecture in ad hoc networks for the purpose of supporting ID-based public key cryptosystems because of the advantage that ID-based schemes require less complex infrastructure compared with the traditional public key cryptosystems. We assume a trusted key generation center which only issues a private key derived from IDs of every nodes in the system setup phase, and use NIL(Node ID List) and NRL(Node Revocation List) in order to distribute the information about IDs used as public keys in our system. Furthermore, we propose a collaborative status checking mechanism that is performed by nodes themselves not by a central server in ad-hoc network to check the validity of the IDs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.258-261
• /
• 2016

환자가 가정에서 네트워크를 통해 자신의 건강정보를 원격지에 위치한 의사에게 전송하여 이에 대한 진단을 받는 원격건강정보 모니터링 시스템에서 환자의 개인건강정보의 보호는 매우 중요한 과제이다. 본 논문에서는 신원기반 프록시 재암호화 기법을 사용하여 환자가 다수의 의사를 선택하여 각 의사들에게 개인건강정보를 전송하여 진단을 받는 환경을 가정하여 환자가 가지는 연산부담을 줄이기 위해 환자의 비밀키로 생성한 암호문을 프록시가 재암호화하여 의사가 가진 비밀키로 복호화 할 수 있도록 하는 기법을 제안한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.77-89
• /
• 2005

As the ID-based public key cryptosystems become a very active research area, a number of ID-based key agreement protocols have been proposed, but unfortunately many of them were analyzed that there were some security flaws in the protocols. In addition to key agreement protocols, in recent, Liu et al. and Kim et al. proposed the key agreement protocols that multiple session keys are established at once among participated entities. In this paper, we propose an ID-based tripartite key agreement protocol that establishes 8 keys by improving the efficiency of the Liu et al's. Moreover, the proposed protocol can be used in the situation where multiple different private key generators(PKG) are involved. Therefore, because the private key issued by different PKGs belonging to each entity's domain can be used, our proposed scheme is more efficiently applicable to the practical applications.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 1997.10a
• /
• pp.299-311
• /
• 1997

인트라넷은 인터넷 관련 표준 기술들을 바탕으로 기업 내부의 업무와 정보 처리를 보다 효율적으로 하고자하는 새로운 네트워크 개념으로, 인터넷의 특징인 대중성, 경제성을 이어 받아 확장성에 기반한 기술 개방형 구조로써 기존의 기업 환경을 변화시킬 새로운 인 프라로 인식되고 있다. 이러한 인트라넷을 개방된 인터넷 기술과 기업 내 정보 시스템의 결 합이라는 그 특성상 기업 내 정보를 보호하기 위해 정보보호 기술이 필수적으로 요구된다. 지금까지는 인트라넷 외부로부터 정보들을 보호하기 위해 침입차단, 데이터의 암호화 등을 중심으로 구현되었지만, 인트라넷 내부에서 정보를 보호하고자 하는 노력은 아직 적용된 사 례가 전무한 실정이다. 이에 본 논문에서는 현재 구현되고 있는 인트라넷 서비스에 대한 기 업 내부의 보안위협들을 살펴보고, 암호기술 및 암호프로토콜을 이용한 보안 모델을 제안하 고 각종 프로토콜 및 알고리즘을 컴퓨터 시뮬레이션을 통해 수행한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.240-242
• /
• 2021

인증 및 그룹키 합의 프로토콜은 통신하고자 하는 여러 구성원들의 그룹키를 합의하여 안전한 그룹 통신을 제공할 수 있다. 현재 안전하고 효율적인 인증 및 그룹키 합의 프로토콜을 위한 연구가 활발히 진행 중이다. 기존의 공개키 인프라 기반 인증 및 그룹키 합의 방식에는 인증서와 키의 관리 문제가 나타나며 신원 기반 인증 및 그룹키 합의 방식에는 키 에스크로 문제가 나타난다. 본 논문은 이러한 문제를 해결 할 수 있는 무인증서 기반 인증 및 그룹키 합의 방식을 제안한다. 또한, 본 논문에서는 기존에 무인증서 암호시스템에 발생할 수 있는 공개키 대체로 인한 위장 공격을 방지할 수 있는 방법을 설계한다. 제안하는 방식은 효율성을 제공하기 위해서 구성원 수거 증가하더라도 통신 Round 수가 증가하지 않는 특징을 갖는다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.81-86
• /
• 2009

Almost all network systems provide an authentication mechanism based on user ID and password. In such system, it is easy to obtain the user password using a sniffer program with illegal eavesdropping. The one-time password and challenge-response method are useful authentication schemes that protect the user passwords against eavesdropping. In client/server environments, the one-time password scheme using time is especially useful because it solves the synchronization problem. In this paper, we propose a new identification scheme One Pass Identification. The security of Password base System is based on the square root problem, and Password base System is secure against the well known attacks including pre-play attack, off-line dictionary attack and server comprise. A number of pass of Password base System is one, and Password base System processes the password and does not need the key. We think that Password base System is excellent for the consuming time to verify the prover.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.6
• /
• pp.17-22
• /
• 2009

Certificateless cryptography eliminates the need of certificacates in the public key crytosystems and solves the inherent key escrow problem in identity-based cryptosystems. This paper demonstrates that two certificateless signature schemes proposed by Guo et al. and Wang et al. respectively are insecure against key replacement attacks by a type I adversary. We show that the adversary who can replace a signer's public key can forge signatures under the replaced public key. We then make a suggestion to prevent the attacks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.3
• /
• pp.125-132
• /
• 2005

Wireless access always has to include the authentication of communication partners and the encryption of communication data in order to use secure M-Commerce services. However, wireless systems have limitations compared with the wired systems, so we need an efficient authentication and key exchange protocol considering these limitations. In this paper, we propose an efficient authentication and key exchange protocol for M-Commerce users using elliptic curve crypto systems. The proposed protocol reduces the computational load of mobile users because the wireless service provider accomplishes some parts of computations instead of the mobile user, and it uses the password-based authentication in wireless links. Also, it guarantees the anonymity of the mobile user not to reveal directly the real identity of the user to the M-Commerce host, and preserves the confidentiality of communication data between the M-Commerce host and the user not to know the contents of communication between them to others including the wireless service provider.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.495-502
• /
• 2013

In this paper, we present an anonymous authentication and location assurance protocol for secure location-aware services over vehicular ad hoc networks (VANETs). In other to achieve our goal, we propose the notion of a location-aware signing key so as to strongly bind geographic location information to cryptographic function while providing conditional privacy preservation which is a desirable property for secure vehicular communications. Furthermore, the proposed protocol provides an efficient procedure based on hash chain technique for revocation checking to effectively alleviate communication and computational costs on vehicles in VANETs. Finally, we demonstrate comprehensive analysis to confirm the fulfillment of the security objectives, and the efficiency and effectiveness of the proposed protocol.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.585-594
• /
• 2004

When several service providers want to work together with only one master key, they need to properly distribute the key to participants who come in for the co-work business and then securely manage the distributed keys. This paper describes the system that can efficiently and securely manage the master key on the basis of the secret sharing scheme that can reconstruct original secret information as the necessity of reconstructing original secret arises. The proposed system can distribute secret information to several groups and also redistribute the secret to subgroup in proportion to the participant's security level using smart card-based (t, t)-(k, n)-threshold secret scheme for securely keeping secret information and authentication of participant's identification.