• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.409-418
• /
• 2004

Multicast services are provided on the Internet in fast increasing . Therefore it is important to keep security for multicast communication. Member leaving is deeply associated with scalability problem for group key management. If one member of the group is removed, new group key has to be generated and distributed to all remaining members of group. Minimizing the number of messages and operation cost for generation of the composite keys are important evaluating criteria of multicast key management scheme since generation and distribution of new keys for rekeying require expensive operation. Batch removal can reduce these important parameters rather than removing members sequentially In fashion one after another. In this paper, Hamming distance is calculated between eve교 members to be removed. The members with Hamming distance less than threshold are selected for rekeying procedure. With running the round assignment algorithm In the case of removing several members simultaneously, our model has advantages of reducing the number of message and operation cost for generation of the composite keys and eliminating possibility of collusion attack for rekeying.

• Safety and Health at Work
• /
• v.7 no.4
• /
• pp.347-353
• /
• 2016

Background: This study aimed to investigate the relation between key strike forces and musculoskeletal symptoms (MSS). Moreover, this study presents a key strike force measurement method to be used in a workplace setting. The correlation between key strike force characteristics and MSS was previously studied, but the measurement methods used either a single-key switch or force platforms applied under the keyboard. Most of the studies were conducted in a laboratory setting. The uniqueness of measurement methods in the current study is their ability to measure forces applied to a specific key in a workplace setting and to provide more information about specific key strike forces during typing. Methods: Twenty-four healthy computer workers were recruited for the study. The demographic questionnaire, and self-reported questionnaires for psychosocial status (General Nordic Questionnaire for Psychological and Social Factors at Work) and for detecting MSS were filled up, which later helped in dividing the participants into two groups (12 participants with pain and 12 without pain). Participants typed a predetermined text that utilized the instrumented keys multiple times. The dynamic forces applied to the keys were recorded and collected, using four thin and flexible force sensors attached to the preselected keys according to their location. Results: The results demonstrated that participants with high levels of MSS, specifically in the back and neck, in the last year exerted significantly higher key strike forces than those with lower levels of symptoms (p < 0.005). Conclusion: The key strike force exerted while typing on a keyboard may be a risk factor for MSS, and should therefore be considered in ergonomic evaluations and interventional programs.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.353-362
• /
• 2004

Mobile Ad-Hoc network tends to expose scarce computing resources and various security threats because all traffics are carried in air along with no central management authority. To provide secure communication and save communication overhead, a scheme is inevitable to serurely establish session keys. However, most of key establishment methods for Ad-Hoc network focus on the distribution of a group key to all hosts and/or the efficient public key management. In this paper, a secure and efficient scheme is proposed to establish a session key between two Ad-Hoc nodes. The proposed scheme makes use of the secret sharing mechanism and the Diffie-Hellman key exchange method. For secure intra-cluster communication, each member node establishes session keys with its clusterhead, after mutual authentication using the secret shares. For inter-cluster communication, each node establishes session keys with its correspondent node using the public key and Diffie-Hellman key exchange method. The simulation results prove that the proposed scheme is more secure and efficient than that of the Clusterhead Authentication Based Method(1).

• Computers and Concrete
• /
• v.26 no.2
• /
• pp.161-173
• /
• 2020

Shear keys in precast concrete segmental bridges (PCSBs) are usually match-casting which is very labour intensive. In this research, an innovative match-casting-free construction was proposed by leaving small gap between the convex and the concave castellated shear keys in the joints of PCSBs. Specimen experiment, shear strength analysis and numerical simulation were conducted, investigating the loading performance of this new type of dry joints, the gap dry joints. Compared with match-casting joint specimens, it has been found from experiment that shear capacity of gap joint specimens significantly decreased ranging from 17.75% to 42.43% due to only partially constrained and contacted in case of gap dry joints. Through numerical simulation, the effects of bottom contacting location, the heights of the gap and the shear key base were analyzed to investigate strength reduction and methods to enhance shear capacity of gap joint specimens. Numerical results proved that shear capacity of gap dry joints under full contact condition was higher than that under partial contact. In addition, left contact destroyed the integrity of shear keys, resulting in significant strength reduction. Larger shear key base remarkably increased shear capacity of the gap joint. Experimental tests indicated that AASHTO provision underestimated shear capacity of the match-casting dry joint specimens, while the numerical results for the gap dry joint showed that AASHTO provision underestimated shear capacity of full contact specimens, but overestimated that of left contact specimens.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.9
• /
• pp.5790-5795
• /
• 2014

Elliptic curve cryptography (ECC) is an extremely important part of information protection systems because it has outstanding safety among public key encryption algorithms. On the other hand, as ECC cannot obtain accurate values using a real number field because of the slow calculation and errors from rounding off, studies of ECC have focused on a finite field. If ECC can be extended to the real number field, more diverse keys can be selected compared to ECC only based on a finite field. Accordingly, in this paper, a method for constructing a cryptographic system with a high degree of safety is proposed through the diversification of keys selected by the user based on the operant extension method instead of extracting keys only using integer values.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.1015-1023
• /
• 2004

In order to protect an exchanged data, it is indispensable to establish a peer-to-peer key between the two communicating nodes. Pre-distributing keys among the nodes is unrealistic in Ad-Hoc network environment because of the dynamic nature of its network topology and the equal authority of its nodes. This paper presents a peer-to-peer key establishment scheme without pre-distributing keys in Ad-Hoc networks. The proposed scheme is based on the Diffie-Hellman key exchange protocol. Main idea is to prevent the falsification of Diffe-Hellman values using some elements of a hash chain. As a result, it is as safe as the underlying hash function against a man-in-the-middle attack. Simulation results have shown that the proposed scheme dramatically reduces the number of messages, and has relatively higher scalability, as compared with the key pre-distribution based scheme.

• The Korea Journal of Herbology
• /
• v.30 no.4
• /
• pp.65-69
• /
• 2015

Objectives : The root ofCyanchum wifordii(CW) had been used as herbal medicine, 'Baeksuo', in Korea. However, the root ofCynanchum auriculatum(CA) had also been mis-used as 'Baeksuo' in herbal markets, due to its morphological similarity with CW. This study aimed to compare discriminative features and establish the identification-keys between two herbal medicines using microscopic methods.Methods : Microscopic preparations including fixation, rapid dehydration, paraffin infiltration, paraffin embedding, sectioning, mounting, and staining, were performed and the microscopic features between CW and CA samples were compared.Results : The starch grain of parenchymal cells, the amounts of calcium oxalate crystals, cell sizes, and the shape of phloem were not different between CW and CA samples. However, the clusters of stone cells which were conglomerated at outer cortex were apparently observed in CA sample (4~8 layers of stone cells), but not in CW sample (2~4 layers of stone cells, or not). Xylem of CW consisted of several vessels and fiber bundles which were formed as linear shapes and discontinuous radial lines, while that of CA, in which radial lines was not observed, were shaped as a wedge and scattered near cambium with comparatively few fiber bundles enclosed vessels. Especially, in the xylem of CA, fiber bundles located towards cambium were relatively more developed than those located outward cambium.Conclusions : The identification-keys established in this study would be helpful to discriminate microscopic features between CW and CA.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.4
• /
• pp.671-678
• /
• 2017

Recent advances in Internet of Things (IoT) encourage us to use IoT devices in daily living areas. However, as IoT devices are being ubiquitously used, concerns onsecurity and privacy of IoT devices are getting grown. Key management is an important and fundamental task to provide security services. For better security, we should restrict reusing a same key in sequential authentication sessions, but it is difficult to manually update and memorize keys. In this paper, we propose a hardware security module(HSM) for automated key management in IoT devices. Our HSM is attached to an IoT device and communicates with the device. It provides an automated, secure key update process without any user intervention. The secure keys provided by our HSM can be used in the user and device authentications for any internet services.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.9-17
• /
• 2015

The development of wireless communication technology and change in the ICT market has led to the development of the M2M service and technology. Under these circumstances, the M2M environment has been the focus of communication environment construction between machines without control or direct intervention of human being. With characteristics of wireless communication environment, the possibility of being exposed to numerous security threats and safe communication security technology have becoming an issue an important requirements for problems such as data exposure, forgery, modulation, deletion, and privacy. This research analyzes requirements of trapdoor collision hash, generates keys between groups under the M2M environment by using the specificity of trapdoor, and suggests technology to exchange keys with session keys. Further, it also suggests techniques to confirm authentication of device and gateway in accordance with group key generation. The techniques herein suggested are confirmed as safe methods in that they have attack resistance such as Masquerade Attack, Man-in-the-Middle Attack, and Replay Attack in the group communication block by using the speciality of collision message and collision hash.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.55-66
• /
• 2004

The Internet today provides group communication model, multicast service. It is important to keep security for multicast communication. Member leaving is associated with scalability problem for group key management. If one member of the group is removed, new group key has to be changed and communicated to all remaining members of group. Modification and distribution of new group keys for rekeying is an expensive operation. Minimizing the number of messages and operation cost for generation of the composite keys are important evaluating criteria of multicast key management scheme. Periodic rekey helps reducing these important parameters rather than removing members sequentially in fashion one after another. In this paper, Hamming distance is calculated between every members to be removed. The members with Hamming distance less than threshold are selected for rekeying procedure. With running the round assignment algorithm, our model has advantages of reducing the number of message and operation cost for generation of the composite keys for rekeying.