• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.2
• /
• pp.178-194
• /
• 2009

Current group key agreement protocols(often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2769-2792
• /
• 2013

In this paper, we propose an authenticated key agreement scheme, TinyIBAK, based on the identity-based cryptography and bilinear paring, for large scale sensor networks. We prove the security of our proposal in the random oracle model. According to the formal security validation using AVISPA, the proposed scheme is strongly secure against the passive and active attacks, such as replay, man-in-the middle and node compromise attacks, etc. We implemented our proposal for TinyOS-2.1, analyzed the memory occupation, and evaluated the time and energy performance on the MICAz motes using the Avrora toolkits. Moreover, we deployed our proposal within the TOSSIM simulation framework, and investigated the effect of node density on the performance of our scheme. Experimental results indicate that our proposal consumes an acceptable amount of resources, and is feasible for infrequent key distribution and rekeying in large scale sensor networks. Compared with other ID-based key agreement approaches, TinyIBAK is much more efficient or comparable in performance but provides rekeying. Compared with the traditional key pre-distribution schemes, TinyIBAK achieves significant improvements in terms of security strength, key connectivity, scalability, communication and storage overhead, and enables efficient secure rekeying.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.149-165
• /
• 2013

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1737-1753
• /
• 2013

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.512-516
• /
• 2008

A conference-key agreement protocol is essential for computer network conferences that need secure communications. Especially, the fault-tolerant conference-key agreement can make a shared conference-key even if some make conferees disturb the key agreement processes. However, the performance of the previous fault-tolerant conference-key agreement protocols is decreasing significantly when the number of fake conferees is increasing. In this paper, we propose an efficient fault-tolerant conference key agreement protocol. Our scheme is based on the ID-based one round tripartite conference key agreement protocol. Simulation results show our scheme's efficiency against Yi's method especially when the number of fake conferees is large.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.2
• /
• pp.88-94
• /
• 2008

It is very important for weapon systems to manage the logistic support for the better combat readiness. Therefore, in this paper we review the issues of logistic support and suggest alternatives to effectively manage the logistic support for weapon systems by using performance based logistics, especially during operations and support phase.

• Health Policy and Management
• /
• v.11 no.1
• /
• pp.1-18
• /
• 2001

The purpose of the present study was to assess the agreement of survival probability estimated by International Classification of Diseases l0th Edition(ICD-10) based International Classification of Diseases based Injury Severity Score(ICISS) with professional panel's judgment on preventable death. ICISS has a promise as an alternative to Trauma and Injury Severity Score(TRISS) which have served as a standard measure of trauma severity, but requires more validation studies. Furthermore as original version of ICISS was based ICD-9CM, it is necessary to test its performance employing ICD-10 which has been used in Korea and is expected to replace ICD-9 in many countries sooner or later. Methods : For 1997 and 1998 131 trauma deaths and 1,785 blunt trauma inpatients from 6 emergency medical centers were randomly sampled and reviewed. Trauma deaths were reviewed by professional panels with hospital records and survival probability of trauma inpatients was assessed using ICD-10 based ICISS. For trauma mortality degree of agreement between ICISS survival probability with judgment of professional panel on preventable death was assessed and correlation between W-score and preventable death rate by each emergency medical center was assessed. Results : Overall agreement rate of ICISS survival probability with preventable death judged by professional panel was 66.4%(kappa statistic 0.36). Spearman's correlation coefficient between W-score and preventable death rate by each emergency medical center was -0.77(p=0.07) and Pearson's correlation coefficient between them was -0.90(p=0.01). Conclusions : The agreement rate of ICD-10 based ICISS survival probability with of professional panel's judgment on preventable death was similar to TRISS. The W-scores of emergency medical centers derived from ICD-10 based ICISS were highly correlated with preventable death rates of them with marginal statistical significance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.3
• /
• pp.163-167
• /
• 2009

In this paper, we analyze key agreement algorithms based on co-cyclic Jacket matrices, and propose key agreement algorithms based on co-cyclic Hadamard matrices to fix the problem. The performance of our proposal is better than conventional one's and the construction of the matrices is very simple. Also time complexity of our proposal is proportional to the factor that determinees the size of the matrix, and the length of the key. So our proposal is fast and will be useful for the communcations of two or three users, especially for those have low computing power.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1825-1842
• /
• 2013

Rapid growth of the IT industry has led to significant energy consumption in the last decade. Data centers swallow an enormous amount of electrical energy and have high operating costs and carbon dioxide excretions. In response to this, the dynamic consolidation of virtual machines (VMs) allows for efficient resource management and reduces power consumption through the live migration of VMs in the hosts. Moreover, each client typically has a service level agreement (SLA), this leads to stipulations in dealing with energy-performance trade-offs, as aggressive consolidation may lead to performance degradation beyond the negotiation. In this paper we propose a heuristic based resource allocation of VM selection and a VM allocation approach that aims to minimize the total energy consumption and operating costs while meeting the client-level SLA. Our experiment results demonstrate significant enhancements in cloud providers' profit and energy savings while improving the SLA at a certain level.

• Proceedings of the KIEE Conference
• /
• 2005.07e
• /
• pp.112-114
• /
• 2005

It is obvious that electrical safety cannot be secured soley by the efforts from public sector including government. With the global trend of deregulation as WTO/TBT agreement comes into effect, foreign countries strive to minimize unnecessary and inefficient regulations in every field by sharing responsibilities with the privae sector to secure international competency in trade. To this same end, in this paper 2 level approach plan is suggested to pave the way to the self-security system in electrical field by introducing self-reliance safety system by stage for pre-service inspection on the electrical installations for private use based on product requirements in terms of performance.