• 한국통신학회논문지
• /
• 제33권1C호
• /
• pp.117-123
• /
• 2008

본 논문은 무선 환경에서의 향상된 경계 결정 기반의 Diffie-Hellman(DH) 키 일치 프로토콜을 제안한다. 제안하는 프로토콜에서는 경계 결정을 통해 두 사용자간에 주고받는 메시지의 무결성과 안정성을 보장한다. 본 논문은 종래의 경계 결정 기반의 DH 키 일치 프로토콜의 비효율적이고 불안정적인 측면을 보완하여 교환되어야 할 메시지 수와 관리해야 할 파라미터 수를 줄였으며 2(7682(k/64)-64) 개의 XOR 연산을 절감하였다. 또한 DH 공개 정보의 안전한 재사용을 가능하게 함으로써 사용자의 개입을 감소시킬 수 있다.

• 정보보호학회논문지
• /
• 제13권5호
• /
• pp.113-127
• /
• 2003

WAP의 보안 프로토콜인 WTLS는 무선 인터넷 프로토콜에서 TCP의 보안에 사용하는 TLS를 무선 환경에 맞게 최적한 것으로, 안전하고 효율적인 서비스 제공을 목적으로 하고 있다. WTLS 프로토콜은 Handshake, ChangeCipherSpec, Alert, Application Data 등 4개의 프로토콜로 구성되어 있으며, 본 논문에서는 Handshake 프로토콜에 대해 master secret를 설정하는 과정과 특징을 분석하고, 이를 기반으로 하여 능동적 공격자 모델에 대한 안전성을 분석한다. 또한 안전성 분석 결과를 바탕으로 능동적 공격자 모델에 안전하고 다양한 보안 서비스를 제공할 수 있는 새로운 Handshake 프로토콜을 제안한다.

• 충청수학회지
• /
• 제20권4호
• /
• pp.355-366
• /
• 2007

In this paper, we propose a new blind group identification protocol and a hidden group signature protocol as its application. These protocols involve many provers and one verifier such that (1) the statement of all the provers are proved simultaneously, (2) and also all the provers using computationally limited devices (e.g. smart cards) have no need of computing the bilinear pairings, (3) but only the verifier uses the bilinear pairings. A. Saxena et al. proposed a two-round blind (group) identification protocol in 2005 using the bilinear pairings. But it reveals weakness in the active-intruder attack, and all the provers as well as the verifier must have devices computing bilinear pairings. Comparing their results, our protocol is secure from the active-intruder attack and has more fit for smart cards. In particular, it is secure under only the assumption of the hardness of the Discrete-Logarithm Problem in bilinear groups.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.993-996
• /
• 1999

A mobile agent is a program which is capable of migrating autonomously from host to host in the heterogeneous network, to perform some computation on behalf of the user. Mobile agents have many advantages in the distributed computing environment. But they are likely to suffer many attacks on the security due to the mobility. In order to make use of a mobile agent in the real applications, the security issues must be addressed. We deal with the problem which is concerned with protecting a mobile agent in transit and detecting a mobile agent clone. In this paper we propose a trust center based secure mobile agent transfer protocol. This protocol transfers a mobile agent securely from host to host and detects a mobile agent clone. We further show the security of the protocol against many attacks.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.869-877
• /
• 2011

In this paper, we propose an efficient two-flow zero-knowledge blind identification protocol on the elliptic curve cryptographic (ECC) system. A. Saxena et al. first proposed a two-flow blind identification protocol in 2005. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. But our protocol is secure under such attacks because of using the hash function. In particular, it is fast because we don't use the pairing operation and consists of only two message flows. It does not rely on any underlying signature or encryption scheme. Our protocol is secure assuming the hardness of the Discrete-Logarithm Problem in bilinear groups.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권6호
• /
• pp.1982-2004
• /
• 2014

Wireless Mesh Networks (WMNs) are emerging as promising, convenient next generation wireless network technology. There is a great need for a secure framework for routing in WMNs and several research studies have proposed secure versions of the default routing protocol of WMNs. In this paper, we propose a security framework for Hybrid Wireless Mesh Protocol (HWMP) in WMNs. Contrary to existing schemes, our proposed framework ensures both end-to-end and point-to-point authentication and integrity to both mutable and non-mutable fields of routing frames by adding message extension fields to the HWMP path selection frame elements. Security analysis and simulation results show that the proposed approach performs significantly well in spite of the cryptographic computations involved in routing.

• 한국통신학회논문지
• /
• 제41권3호
• /
• pp.298-300
• /
• 2016

본고에서는 중계 공격 성공확률을 낮추기 위해 RFID 리더가 무요청(void challenge)을 보내더라도 태그가 응답하는 거리 제한 프로토콜을 제안한다. Full challenge 비율에 따른 공격 성공 확률을 분석하고, 기존의 프로토콜과 비교 분석하여 제안 프로토콜의 공격 성공 확률이 낮음을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권8호
• /
• pp.4025-4042
• /
• 2017

Session initiation protocol (SIP) is a kind of powerful and common protocols applied for the voice over internet protocol. The security and efficiency are two urgent requirements and admired properties of SIP. Recently, Hamed et al. proposed an efficient authentication and key agreement scheme for SIP. However, we demonstrate that Hamed et al.'s scheme is vulnerable to de-synchronization attack and cannot provide anonymity for users. Furthermore, we propose an improved and efficient authentication and key agreement scheme by using elliptic curve cryptosystem. Besides, we prove that the proposed scheme is provably secure by using secure formal proof based on Burrows-Abadi-Needham logic. The comparison with the relevant schemes shows that our proposed scheme has lower computation costs and can provide stronger security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.431-443
• /
• 2016

Secure multi-party computation (MPC) has been a research focus of cryptography in resent studies. However, hiding the topology of the network in secure computation is a rather novel goal. Inspired by a seminal paper [1], we proposed a topology-hiding broadcast protocol based on NTRUEncrypt and secret sharing. The topology is concealed as long as any part of the network is corrupted. And we also illustrated the merits of our protocol by performance and security analysis.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.287-287
• /
• 2006