• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.35-44
• /
• 2006

As the E-commerce and E-business are developed actively, using certificate is incremented rapidly. The certificate validation must be confirmed at first in E-commerce and the OCSP Responder can offer CSI to the client using OCSP. With the rapid development of the E-commerce based on the Internet, a lot of clients request CSI to OCSP Responder. So, the load to OCSP Responder is increased and the OCSP Responder may be overloaded. Therefore, for distributing the load to an OCSP Responder, D-OCSP is introduced. As the CRL has a lot of information about revoked certificates and have a high exposure Possibility of information in the process of distribution, the confidentiality as well as integrity are required in the process of distribution. So, we propose a CRL distributing method based on group key agreement in D-OCSP. The proposed method can distribute effectively a published CRL to OCSP Responders with confidentiality as well as integrity and offer concurrency that each OCSP Responder can start CSI servicing of new CRL to clients at the same time.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.45-48
• /
• 2004

Diffie-Hellman(DH) 키공유 기법[1]이 제안된 후 많은 종류의 키공유 기법들이 연구되었으며, 특히 특정한 그룹 내의 구성원들이 안전한 통신을 할 수 있게 하기 위한 그룹 기반의 키공유 기법들이 제안되었다. 이러한 기법들은 PKI(Public Key Infrastructure) 등을 사용하는 여러 응용들에서 쉽게 사용될 수 있지만, ad-hoc통신망과 같이 특정한 기반구조를 사용할 수 없는 환경에서는 적용하기 어렵다. [2]에서는 ad-hoc 환경에서 사용할 수 있는 그룹(conference) 기반의 키공유 기법을 제안하였지만, n$^{+2}$ 라운드의 통신량이 요구되며, 그룹 구성원들의 위치정보와 같은 부가정보를 알고 있어야 하는 문제점이 있다. 본 논문에서는 ad-hoc 환경에서 그룹 구성원들의 위치정보를 알 필요 없는 효율적인 2-라운드 키공유 기법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.969-972
• /
• 2012

기존의 CCTV와는 달리 IP Camera는 네트워크에 유선 또는 무선으로 직접 연결되며 IP Camera에 임베디드된 웹 서버를 통하여 서비스를 제공한다. 한 건물 또는 지역 안에는 다수의 IP Camera가 설치될 수 있다. 이때 각 각의 IP Camera에 웹 서버가 존재하기 때문에 웹서버 마다 다른 key를 가지고 관리하게 되어 서버 관리에 있어서 비효율적이다. 또한 단순 ID, Password로 사용자 인증을 하며 별도의 암호화 과정을 거치지 않기 때문에 취약점을 갖는다. 따라서 본 논문에서는 그룹 키를 이용하여 다수의 웹 서버의 키를 관리하고 PKI 암호를 통하여 사용자 인증 및 세션 키를 생성함으로써 위장 공격, 기밀성, 무결성, 재사용 공격 등의 보안 취약점을 강화한다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.322-325
• /
• 2006

그룹 키 동의 프로토콜에 관한 연구는 그동안 많은 연구자들에 의해 다양한 관점에서 진행되어왔으며, 최근 Nam 등이 유 무선 통합 네트워크 환경에서 효율적이면서도 안전한 그룹 키 동의 프로토콜을 제안하였다. 유 무선 통합 네트워크 환경에 적합한 그룹 키 동의 프로토콜을 설계하기 위해서는 고성능 연산 능력을 가진 유선 단말기의 특성과 상대적으로 계산능력이 떨어지는 무선 단말기의 특성이 함께 고려되어야 한다. 특히, 시스템자원의 제한성을 갖는 무선 단말기에서의 계산량을 최소화하는 문제는 그룹 키 동의 프로토콜 설계에 있어서 무엇보다 중요하다. 따라서, 본 논문에서는 무선 단말기의 계산량을 최소화하면서 유 무선 통합 네트워크 환경에 적합한 효율적인 그룹 키 동의 프로토콜을 제안하고자 한다.

• Journal of Ocean Engineering and Technology
• /
• v.23 no.3
• /
• pp.14-19
• /
• 2009

The present study developed a model to estimate the light weight of an ultra-large container ship. The weight estimation model utilized container ship data obtained from shipyards and the subdivided this weight data into appropriate weight groups. Parameters potentially affecting the group weight were selected and expanded based on experience for weight estimation, and a correlation analysis was performed by the SPSS program to determine the key parameters characterizing the group weight. A weight estimation model applying the multi-regression analysis was proposed to assess the weight of an ultra-large container ship at the preliminary design stage, and the results obtained by the suggested method showed good agreement with the shipyard data.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.101-128
• /
• 2018

Thanks to its potential in many applications, Blockchain has recently been nominated as one of the technologies exciting intense attention. Blockchain has solved the problem of changing the original low-trust centralized ledger held by a single third-party, to a high-trust decentralized form held by different entities, or in other words, verifying nodes. The key contribution of the work of Blockchain is the consensus algorithm, which decides how agreement is made to append a new block between all nodes in the verifying network. Blockchain algorithms can be categorized into two main groups. The first group is proof-based consensus, which requires the nodes joining the verifying network to show that they are more qualified than the others to do the appending work. The second group is voting-based consensus, which requires nodes in the network to exchange their results of verifying a new block or transaction, before making the final decision. In this paper, we present a review of the Blockchain consensus algorithms that have been researched and that are being applied in some well-known applications at this time.

• Journal of Korean society of Dental Hygiene
• /
• v.17 no.5
• /
• pp.921-930
• /
• 2017

Objectives: The purposes of this study were to analyze the trade newspapers related to 'recognition of the dental hygienist as the healthcare professional' using R program and to identify opinions of groups concerned with dental hygienists. Methods: This study was designed with contents analysis and cross-sectional. The subjects of the study were the articles for the last three years in medical and dental newspapers about the recognition of the dental hygienist as the healthcare professional. The collected articles were categorized and classified for each group's opinions about the issue. The key words were extracted according to the priorities of the opinions of agreement and disagreement. They were visualized after frequency analysis using R, a big data analysis program. Results: A total of 237 newspaper articles were extracted among 270 ones containing opinions. 245 were positive opinions and 25 were negatives. The main key words of the agreement were 'Amendment of Medical Law', 'Medical Practice', and 'Legal Guarantee of the Practice'. Advocates addressed that the issues should be resolved with the amendment of the law, as dental hygienists are not guaranteed to work based on the current law although they are actually doing the medical practices. Main key words of disagreement were 'Legal Guarantee of the Practice', 'Revision of Medical Technician Law', and 'Review of Job Type'. They described that the problem can be resolved by revising medical technicians act, and it needs to consider as job types of all healthcare professional. Conclusions: In the group who showed the positive opinions, it is possible to utilize measures such as promoting the cooperation of dental hygienists and developing public consensus through publicity.

• Publications of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.633-636
• /
• 2015

KaVA (KVN and VERA Array) is a new combined VLBI array composed of KVN (Korean VLBI Network) and VERA (VLBI Exploration of Radio Astrometry). Here, we report the following two issues. (1) We review the initial results of imaging observations of M87 at 23 GHz following Niinuma et al. (2014). The KaVA images reveal extended outflows including complex substructures such as knots and limb-brightening, in agreement with previous VLBI observations. KaVA achieves a high dynamic range of ~1000, more than three times better than that achieved by VERA alone. (2) Based on subsequent observations and discussions led by the KaVA AGN SubWorking Group, we set monitoring observations of Sgr $A^{\ast}$ and M87 as our Key Science Project (hereafter KSP) because of the closeness and largeness of their central super-massive black holes. The main science goals of the KSP are (i) testing the magnetically-driven-jet paradigm by mapping velocity fields of the M87 jet, and (ii) obtaining tight constraints on physical properties of the radio emitting region in Sgr $A^{\ast}$. Towards KSP, we show the first preliminary images of M87 at 23 GHz and Sgr $A^{\ast}$ at 43 GHz with the bandwidth of 256 MHz.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.391-394
• /
• 2002

그룹통신에 대한 관심이 높아지면서 이제 그룹통신 보안문제도 점점 관심을 얻어가고 있다. 보안문제 중에서 그룹보안통신에서 사용하는 그룹 키 관리가 보안의 초석이라고 할 수 있다. 그룹 키 관리는 그룹 키 분배와 그룹 키 동의가 있는데 본 논문에서는 그룹키 동의에 대해 다룬다. 이제껏 그룹 키 동의는 디피-헬만(Diffie-Hellman)을 기반으로 키 동의를 해 왔다. 본 논문에서는 디피-헬만을 대신하여 타원곡선에서 이산로그문제의 어려움을 바탕으로 한 타원곡선 디피-헬만의 사용을 제시하며, 타원 곡선 디피-헬만을 기반으로 한 키 트리 기반 그룹 키 생성의 성능을 분석한다.

• Bulletin of the Korean Chemical Society
• /
• v.35 no.9
• /
• pp.2673-2678
• /
• 2014

The detailed mechanisms of the efficient $\small{L}$-proline and pyrrolidine catalyzed transamidation of acetamide with benzylamine have been investigated using density functional theory (DFT) calculations. Our calculated results show: (1) the mechanisms of two catalytic cycle reactions are similar. However, the rate-determining steps of their reactions are different for the whole catalytic process. One is the intramolecular nucleophilic addition reaction of 1-COM, the other is hydrolysis reaction of 2-C. (2) COOH group of $\small{L}$-proline is essential for efficient transamidation. The computational results are in good agreement with the experiment finding and mechanism resported by Rao et al. for $\small{L}$-proline-catalyzed synthesis of amidesin good to excellent yields.