• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.5
• /
• pp.147-157
• /
• 2003

We often use cryptographic systems on small devices such as mobile phones, smart cards and so on. But such devices are delicate against the tlreat of key exposure of secret keys. To reduce the damage caused by exposure of secret keys stored on such devices, the concept of forward security is introduced. In this Paper, we present a new forward secure signature scheme based on Gap Diffie-Hellman groups. Our scheme achieves security against chosen-message attacks under the computational Diffie-Hellman assumption in the random oracle model.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.339-344
• /
• 2006

Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• KEPCO Journal on Electric Power and Energy
• /
• v.5 no.3
• /
• pp.135-140
• /
• 2019

Lattice towers and tubular steel poles have been commonly used for electrical power transmission in Korea. They are durable, structurally stable, simple and can easily be constructed in limited spaces. However, residents are opposed to construct transmission lattice towers in their areas because they are not visually attractive, and electrical field occur at the transmission lines. Underground transmissions have been used instead of the traditional towers to resolve these problems, however they are not cost effective to construct and run. Therefore, we have developed eco-friendly towers that are more attractive, well blending into the surrounding environment, and much more economical than underground transmissions. There are four categories of the eco-friendly electric transmission towers about design aspects. Firstly, there is decoration type such as tree tower and ensemble tower. Tree tower looks like actual trees with leaves and branches so it blends into surroundings. Ensemble towers were designed after pair of crane birds. Those towers have decoration features and art works. Structural examination and manufacturing this type would be very similar to the conventional transmission towers. Secondly, there is arm design type such as traditional tower. Design features are added to the existing towers. As partial design can be adoptable on these types, it can easily meet height regulations and attach to conventional lattice towers and tubular steel poles. Also, these towers are more economical than others. Third category is multipurpose type such as Sail Tower. These towers have simple pole or tubular structure with features which can be used as information message board, public relations and much more. This type will face greater wind pressure because of the area of the board, also visibility must take into consideration. Lastly, there is moulding type such as arc pylon. It is different shape to the conventional towers - lattice towers and tubular steel poles. Dramatic design changes have been adapted - from a hard and static tower to a soft and curved tower. These towers will well stand out in the field. However, structural examination and manufacturing this type would be difficult and costly. Also certain towers of this type would require scaffolding or false work to construct, which will result in limitations of the construction area. This paper shows KEPCO 154 kV Sail tower in detail. KEPCO 154 kV Sail tower that is included in fabrication of sample tower and tower testing has developed and the results are presented in this paper. We hope that sail tower is also considered as a solution to have public acceptance or to create a familiar atmosphere among towers and people in coastal area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1436-1457
• /
• 2018

Secure routing services in Wireless Sensor Networks (WSNs) are essential, especially in mission critical fields such as the military and in medical applications. Additionally, they play a vital role in the current and future Internet of Things (IoT) services. Lightness and efficiency of a routing protocol are not the only requirements that guarantee success; security assurance also needs to be enforced. This paper proposes a Secure-Fuzzy Energy Aware Routing Protocol (S-FEAR) for WSNs. S-FEAR applies a security model to an existing energy efficient FEAR protocol. As part of this research, the S-FEAR protocol has been analyzed in terms of the communication and processing costs associated with building and applying this model, regardless of the security techniques used. Moreover, the Qualnet network simulator was used to implement both FEAR and S-FEAR after carefully selecting the following security techniques to achieve both authentication and data integrity: the Cipher Block Chaining-Message Authentication Code (CBC-MAC) and the Elliptic Curve Digital Signature Algorithm (ECDSA). The performance of both protocols was assessed in terms of complexity and energy consumption. The results reveal that achieving authentication and data integrity successfully excluded all attackers from the network topology regardless of the percentage of attackers. Consequently, the constructed topology is secure and thus, safe data transmission over the network is ensured. Simulation results show that using CBC-MAC for example, costs 0.00064% of network energy while ECDSA costs about 0.0091%. On the other hand, attacks cost the network about 4.7 times the cost of applying these techniques.

• The Research Journal of the Costume Culture
• /
• v.10 no.3
• /
• pp.213-235
• /
• 2002

The purpose of this study was to recognize the meanings of plastic language by analyzing the sign of the Graffiti depicted in western modern costumes. And the scope of this study was focused on analysing the costumes from 1980's when the Graffiti was recognized as one of the plastic arts. Graffiti was an unprofessional and covert desire of self-expression, having a close relation with our lives. It was used in diverse ways with repeating creation, development, and extinction, from expressing liveliness in Old Stone Age through describing symbolic meaning in the modern art. Graffiti means rude, humorous, or political writing and pictures on the walls of buildings. It's different from the delicate letters or pictures to inscript on the tree or rocks. Being introduced as part of Post-modernism in the 1970s, Graffiti was acknowledged as a new artistic action with the culture of hip-hop. In addition the Graffiti, the expression of sign was reflected artist's internal consciousness with boundless sign. The sign is something to transmit message from the nonverbal point of view, the oldest sign was the sign for petition or the expression of something as a primitive form. Sign can be defined as a framework of life inherited as a practice from the primitive age long past. Graffiti was cited as a concrete example of sign, theme of this paper, and general understanding on sign expression was pursued through free work which all artists present with essential and positive ways using signs, their own languages, and life style. The result of this study was summarized as follows: Since the end of the 20th century, a lot of fashion designers have represented symbolic images, such as letter and signs, as purely personal ways of expression through the western costumes. It was found that fashion designers of the Graffiti whose free work style from inherent inner consciousness might provide a basic framework to search for complex signs of modem costumes naturally understood life itself as plastic art, and sublimated human inherent desire and their inner world through their works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1180-1192
• /
• 1996

On demand of many users, basic networks of a parallel computer system are required to have a property that can embed various topologies. Bisectional interconnection network is known to satisfy this property, and it can embed various topologies optimally. Nowadays one is very interested in the hypercube as a message pssing multicomputer system, so it is very important to implement a hypercube in bisectional network. In this paper, a hypercube is implemented in a versatile bisecional netork, and its routing and broadcasting algorithm are proposed. Conventional bisectional network can accomodata linear array, complete binary tree and mesh structure as its topology. Now hypercube is implemented to be utilized as a general purpose supercomputercommunication architecture. The proposed routing and broadcasting algorithm embedded in bisectional network are general purpose algorithms which satisfy property of conventional hypercube.

• Textile Coloration and Finishing
• /
• v.21 no.2
• /
• pp.48-53
• /
• 2009

Reproduction of antique document is of importance with the concept of sharing the their contents and original aspects in terms of textual and artistic message. 'Pine tree ink stick' and 'Oil ink stick' are greatly enjoyed in their uses in the most written documentary works. Thus, it is said that the approach of this study has implied considerable meanings to cultural aspects. In this work, we have performed to investigate the reproduction and restoration study for antique documents. With comparison and analysis of some types of "ink stick", we have prepared several ink samples, controlling viscosity, surfactant, thickness agent, and applied these inks to the target antique document. Several reproduced samples showed a practical application possibility in terms of reproduction and restoration.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.263-274
• /
• 2010

Mutual exclusion that applied on existing systems was designed for static distributed systems. but now computing environments are going to mobile computing environments. Therefore a mutual exclusion algorithm in static distributed environments should be designed for new computing environments. So this paper proposes a mobile mutual exclusion algorithm to support the mutual exclusion of shared resources in mobile computer environments. Mobile computing resources as wireless hosts cause new issues because of their mobility and weakness and made mutual exclusion problem more complex than stationary distributed environments. So we proposed a new mobile token mutual exclusion algorithm with deadlock-free and starvation-free in mobile computing environments based on spanning tree topology and extend for mobile computing environments. The proposed algorithm minimizes message complexity in case of free hopping in cellular networks.