• 정보보호학회논문지
• /
• 제9권2호
• /
• pp.25-36
• /
• 1999

이 논문에서는 S/KEY 메커니즘에서 사용 횟수 제한과 사전에 키를 만들어 저장해야 하는 중요한 문제점을 해결한 일회용 패스워드 메커니즘을 제안하다. 제안한 일회용 패스워드로부터 인증용키를 생성함으로써 인증용 키관리를 용이하게 하고, 인증과 더불어 클라이언트와 서버간의 통신 세션키의 분배도 가능하게 한다. 그리고 제안한 메커니즘은 스마트 카드를 이용함으로 인증 정보의 보호 및 관리가 용이하며, 서버의 challenge가 없는 클라이언트에서 서버로의 단방향 인증을 필요로 하는 시스템에 바로 적용된다. In this paper we propose a one-time password mechanism that solves the problems of the S/KEY: the limitation of a usage and the need of storage for keys. because of using a cryptographic algorithm the proposed mechanism has no the limitation of a usage. Also because of producing the key for an authentication from a user's password it is easy to manage the authentication key and is possible to share the session key between a client and a server after the authentication process. In addition the proposed mechanism is easy to protect and manage the authentication information because of using a smart card and is adopted by the system that needs a noe-way authentication from a client to a server without the challenge of a server.

• 정보처리학회논문지C
• /
• 제10C권6호
• /
• pp.763-768
• /
• 2003

본 논문에서는 S/KEY 인증 프로토콜과 YEH와 SHEN, HWANG이 제안한 인증 프로토콜의 문지점을 개선하기 위하여 스마트 카드를 적용한 S/KEY 기반의 인증 프로토콜을 제안하였다. 제안프로토골은 SEED를 공유 비밀키로 적용하는 이들의 인증 프로토콜과 달리 공개키를 통해 S/KEY 인증 프로토콜을 개선하였다. 따라서 제안 프로토콜은 공유 비밀키 없이 서버를 인증하고 세션키를 분배 할 수 있다. 또한, 사용자의 암호 구문대신 임의로 생성된 강력한 비밀키를 적용하기 때문에 오프라인 사전 공격을 방지할 수 있다. 특히, 제안 프로토콜은 사용자의 비밀키 혹은 기타 비밀정보를 서버에 저장하지 않는 S/KEY 인증 프로토콜의 장점을 충실하게 만족할 수 있기 때문에 서버의 붕괴로 인해 사용자 로그인 정보가 유출되는 최악의 경우에도 유출된 정보를 통한 각종 공격에 대응할 수 있다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권9호
• /
• pp.1218-1225
• /
• 2004

S/KEY 시스템은 공격자의 패스워드 재공격을 방지하기 위해 제안되었다. 하지만 S/KEY 시스템은 공격자가 자신이 가지고 있는 사전에서 패스프레이즈(passphrase)를 유추해 낼 경우, 결국 인증을 하는데 필요한 일회용 패스워드를 알아낼 수 있는 취약점을 가지고 있다. 이 논문에서는 passphrase에 대한 사전공격을 방지하기 위해 EKE(Encrypted Key Exchange) 프로토콜을 적용한 새로운 S/KEY 시스템을 제시한다. 그리고 새로 제안된 S/KEY 시스템의 안전성을 검증하기 위해 Casper와 CSP로 프로토콜을 명세하고, FDR 모델 체커를 이용하여 그 안전성을 검증하였다.

• 산업기술연구
• /
• 제24권B호
• /
• pp.193-198
• /
• 2004

We propose and analyse a flexible secure file sharing scheme which can be used for data sharing among members in P2P environment. When a member wants to share data, notification messages are sent to the members with whom the member wants to share data. Each notification message includes one-time password encrypted with the receiver's public key. A member who received the notification message can download the data by using the one-time password. The proposed scheme provides selective sharing, download confirmation and efficient memory management. In terms of security, the proposed scheme supports authentication, entity privacy, replay attack protection and disguise prevention.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권1호
• /
• pp.5-21
• /
• 2008

In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.

• 제어로봇시스템학회논문지
• /
• 제22권9호
• /
• pp.766-772
• /
• 2016

Recent advances in networking and computers, especially internet of things (IoT) technologies, have improved the quality of home life and industrial sites. However, the security vulnerability of IoT technologies causes life-threatening issues and information leakage concerns. Studies regarding security algorithms are being conducted. In this paper, we proposed SEED algorithms based on one time passwords (OTPs). The specified server sent time data to the client every 10 seconds. The client changed the security key using time data and generated a ciphertext by combining the changed security key and the matrix. We applied the SEED algorithms with enhanced security to Linux-based embedded boards and android smart phones, then conducted a door lock control experiment (door lock & unlock). In this process, the power consumed for decryption was measured. The power consumption of the OTP-based algorithm was measured as 0.405-0.465W. The OTP-based algorithm didn't show any difference from the existing SEED algorithms, but showed a better performance than the existing algorithms.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.713-716
• /
• 2007

본 논문은 Ad-hoc 네트워크의 무선 보안의 취약성과 현재 활용되고 있는 인증기법을 분석하여, Ad-hoc 기반 강력한 인증을 위해 검증자를 이용한 인증기법을 제안한다. 제안기법은 라우팅, 등록, 실행 단계로 구성하며, 라우팅 단계에서는 AODV 프로토콜을 이용하였다. 등록 및 실행 단계에서는 적법한 소스노드 인증을 위해 원타임 패스워드 S/key와 패스워드 기반 DH-EKE를 적용하였다. 제안 인증 기법의 안전한 패킷 데이터 전송과 데이터 암호화를 위한 세션키 설정시 H(pwd) 검증자로 암호화 하여 키교환을 수행하고, 원타임 패스워드는 소스노드의 패스워드 소유 검증과 효율성 향상을 위해 사용한다. EKE는 식별자를 해쉬함수에 모듈라 지수승 하는 DH-EKE 방식을 이용하여 단대단 세션키를 설정하고 키교환 단계에서는 H(pwd) 검증자로 암호화 함으로써 안전한 세션키 교환을 한다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제10권3호
• /
• pp.11-25
• /
• 2018

While being believed that decrypting any RSA ciphertext is as hard as factorizing the RSA modulus, it was also shown that, if additional information is available, breaking the RSA cryptosystem may be much easier than factoring. For example, Coppersmith showed that, given the 1/2 fraction of the least or the most significant bits of one of two RSA primes, one can factorize the RSA modulus very efficiently, using the lattice-based technique. More recently, introducing the so called cold boot attack, Halderman et al. showed that one can recover cryptographic keys from a decayed DRAM image. And, following up this result, Heninger and Shacham presented a polynomial-time attack which, given 0.27-fraction of the RSA private key of the form (p, q, d, $d_p$, $d_q$), can recover the whole key, provided that the given bits are uniformly distributed. And, based on the work of Heninger and Shacham, this paper presents a different approach for recovering RSA private key bits from decayed key information, under the assumption that some random portion of the private key bits is known. More precisely, we present the algorithm of recovering RSA private key bits from erased key material and elaborate the formula of describing the number of partially-recovered RSA private key candidates in terms of the given erasure rate. Then, the result is justified by some extensive experiments.

• 한국전자거래학회지
• /
• 제6권1호
• /
• pp.17-33
• /
• 2001

EC(Electronic Commerce) which is done on the virtual space through Internet has strong point like independence from time and space. On the contrary, it also has weak point like security problem because anybody can access easily to the system due to open network attribute of Internet, Therefore, we need the solutions that protect the EC security problem for safe and useful EC activity. One of these solutions is the implementation of strong cipher system. YK2(Young Ku King) cipher system proposed in this paper is good solution for the EC security and it overcome the limit of current block cipher system using 128 bits key length for input, output, encryption key and 32 rounds. Moreover, it is designed for the increase of time complexity by adapting more complex design for key scheduling algorithm regarded as one of important element effected to encryption.

• 한국멀티미디어학회논문지
• /
• 제14권9호
• /
• pp.1109-1116
• /
• 2011

In this paper, we propose a new and fast method for assigning the number of key frames to each shot. At first we segment the entire video sequence into elementary content unit called shots and then the key frame allocation is performed by calculating the accumulated value of AF(activity function). The proposed algorithm is based on the amount of content variation using DC images extracted from compressed video. By assigning the number of key frames to the shot that has the largest value of content function, one key frame is assigned at a time until you run out of given all key frames. The main advantage of our proposed method is that we do not need to use time-exhaustive computations in allocating the key frames over the shot and can perform it fully automatically.