• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.809-814
• /
• 2003

The multicast transmitting the real-time data to groups may easily have many attacks from abnormal attacks because it has many links as compared to the unicast. The existing group key management architectures for preventing these problems are designed for protocols suitable for a large scale. Thus these architectures applied to a small scale routing protocols may have many overheads with key distribution and a constant core tree. Therefore this paper proposes a groups key management protocol for a secure multicast in PIM-SM multicast group communication. The proposed method divide multicast groups with RO(Rendezvous-Point), and subgroup key managers are established in each RP and can be transmitted groups keys between senders and receivers, so the security cannel is set up for secure data transfer, And this does not have needs of the data translation for group keys and the new key distribution for path change. As a result of this, the data transmission time can be reduced.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.3
• /
• pp.101-110
• /
• 2003

Secure and reliable group communication is an increasingly active research area prompted by the growing popularity of many types of group-oriented and collaborative applications. The central challenge is secure and efficient group key management. While centralized methods are often appropriate for key distribution in large multicast-style groups, many collaborative group settings require distributed key agreement techniques. Most of prior group key agreement protocols have been focused on reducing the computational costs. One exception is STR protocol that optimizes communicational cost. On the other hand, it requires O(n) number of modular exponentiations. In this paper, we propose a new group key agreement protocol that modifies STR protocol by utilizing pairing based cryptography. The resulting protocol reduces computational cost of STR protocol while preserving the communication cost.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.653-662
• /
• 2016

This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.

• The KIPS Transactions:PartA
• /
• v.11A no.6
• /
• pp.459-468
• /
• 2004

Sharing XML trees on mobile devices has become more and more popular. Optimistic replication of XML trees for mobile devices raises the need for reconciliation of concurrently modified data. Especially for reconciling the modified tree structures, we have to compare trees by node mapping which takes O($n^2$) time. Also, using semantic based conflict resolving policy is often discussed in the literature. In this research, we focused on an efficient reconciliation method for mobile environments, using edit scripts of XML data sent from each device. To get a simple model for mobile devices, we use the XML list data sharing model, which allows inserting/deleting subtrees only for the repetitive parts of the tree, based on the document type. Also, we use keys for repetitive part subtrees, keys are unique between nodes with a same parent. This model not only guarantees that the edit action always results a valid tree but also allows a linear time reconciliation algorithm due to key based list reconciliation. The algorithm proposed in this paper takes linear time to the length of edit scripts, if we can assume that there is no insertion key conflict. Since the previous methods take a linear time to the size of the tree, the proposed method is expected to provide a more efficient reconciliation model in the mobile environment.

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

그룹에 속한 멤버들만이 통신하고자 하는 그룹웨어 응용프로그램이 보안상 중요한 문제로 인식되면서, 그룹키를 안전하게 생성하여 나누어 갖는 것이 필요하게 되었다. 본 논문은 어떤 그룹에 속한 모든 멤버들이 잘 알려진 두 멤버간의 Diffie-Hellman의 키 교환 프로토콜을 이용하여, 모든 메시지들을 안전하게 전달함으로써 그룹키를 나누어 갖는 새로운 그룹키 동의 프로토콜을 제안한다. 이 프로토콜은 완전 이진 트리를 이용하여 기존의 많은 양의 모듈러 멱승 연산을 일부 곱셈 연산으로 전환함으로써, 그룹키를 만드는데 있이 모듈러 멱승 계산량을 줄이는데 효과적이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.292-294
• /
• 2001

멀티캐스트 정보보호 기술은 순수만 멀티캐스트 기술을 실용화 하는데 있어서 없어서는 안될 기술이다. 멀티캐스트 정보보호 기술에서 이슈가 되는 것은 여러 가지가 있으나, 본 논문에서는 인증된 수신자만이 데이터를 볼 수 있도록 하기 위해 필요한 키의 분배 및 rekey 연산에 대해 제안된 몇 가지 기술을 알아보고. 무선환경에서도 확장성을 제공할 수 있는 방안으로 기존의 OFT(One-way Function Tree) 메커니즘을 토대로 하는 WOFT(Mobile OFT) 메커니즘을 제안하고 제안하는 MOFT 메커니즘의 효율성을 분석한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.27-31
• /
• 2008

센서 네트워크에서의 그룹 키 관리가 안전한 그룹 통신을 위해 관심이 증가되고 있다. 본 논문에서는 [1]에서 제안한 그룹 통신을 위한 그룹 키 관리의 단점을 개선한다. 본 논문은 [1]에서의 그룹 리더 대신 알맞은 센서 네트워크 특성을 가진 유일한 이동 노드를 사용하여 효율적인 그룹 키 관리를 한다. 그 결과, 제안한 방안은 [1]에서 제안한 것보다 비용면에서 개선이 있었다.

• Journal of the Korean Society for Railway
• /
• v.7 no.3
• /
• pp.251-258
• /
• 2004

A systematic methodology to determine safety requirements for railway signalling system and safety requirement allocation into system are presented. THR concept is used for as an interface between Risk Analysis to be performed by railway operator and System Design Analysis by the supplier. This approach is based on Signalling Safety Standard EN50129 by CENELEC.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly collaborative mobility behavior. The key problem of those applications is scalability with regard to the number of multicast members as well as the number of the multicast group. To enhance scalability with group mobility, we have proposed a multicast protocol based on a new framework for hierarchical multicasting that is suitable for the group mobility model in MANET. The key design goal of this protocol is to solve the problem of reflecting the node's mobility in the overlay multicast tree, the efficient data delivery within the sub-group with group mobility support, and the scalability problem for the large multicast group size. The results obtained through simulations show that our approach supports scalability and efficient data transmission utilizing the characteristic of group mobility.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.857-860
• /
• 2017

RocksDB는 데이터를 Key-Value쌍으로 다루는 Key-Value 데이터베이스 시스템이며 효율적으로 데이터를 저장하기 위한 자료구조로 Log-Structured Merge-Tree를 사용하고 있다. 이에 더하여, 데이터베이스의 지속성을 위해 WAL 방식으로 로깅을 한다. 이러한 특징들로 인해 RocksDB는 신속하고 효과적인 데이터 처리와 지속성 보존이 가능하여 지속적으로 화두가 되고 있는 데이터베이스 시스템이다. 그러나 RocksDB는 WAL 로깅으로 인한 오버헤드가 발생한다. 본 논문에서는 RocksDB에서 발생하는 WAL 오버헤드를 측정하여 WAL 로깅이 차지하는 오버헤드를 분석하였으며, 차세대 비 휘발성 메모리인 NVRAM을 통해 오버헤드가 얼마나 개선 될 수 있는지 분석하였다. 분석을 통해 로깅 오버헤드는 성능 저하에 상당한 비중을 차지하고 있으며, 디바이스의 쓰기 속도에 따른 로깅 오버헤드의 차이를 발견 하였다.