• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.41-50
• /
• 2013

Social network analysis use the n nodes with l connections. About dozens or hundreds number of nodes are reasonable for social network analysis to the entire data. Beyond such number of nodes it will be difficult to analyze entire data. Therefore, it is necessary to separate the whole social networks, a method that can be used at this time is Clustering. You will be able to easily perform the analysis of the features of social networks and the relationships between nodes, if sub-group consists of all the nodes by Clustering. Clustering algorithm needs the interaction with the user and computer because it is need to pre-set the number of sub-groups. Sub-groups generated like this can not be guaranteed optimal results. In this paper, we propose dynamic sub-groups creating method using the external community association. We compared with previous studies by the number of sub-groups and sub-groups purity standards. Experimental results show the excellence of the proposed method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.251-253
• /
• 2003

권한 위임은 일상에서 흔히 발생하는 사건으로서, 특히, 군대, 기업, 은행 등의 계층 그룹에서는 계층간 권한 위임이 자연스럽고 빈번하게 발생한다. 대리서명(proxy signature)은 서명 권한을 위임받은 대리서명자가 원 서명자를 대신하여 유효한 전자서명을 생성하고 검증할 수 있는 전자서명 프로토콜이다. 계층 구조를 갖는 B2B 전자 거래 및 전자서명의 활용 범위가 다양화됨에 따라 이를 반영하는 보다 안전한 대리서명이 요구된다. 본 논문에서는 계층 그룹에서 반복적 권한 위임을 허용하는 새로운 임계 대리서명 프로토콜을 제안한다. 한 명의 대리서명자가 아닌 복수의 대리서명자가 모여 원 서명자를 대신해 하나의 유효한 대리서명을 생성할 수 있게 함으로써, 보다 강화된 안전성을 제공한다. 대리서명 생성을 위한 권한 위임은 위임티켓을 통해 계층 구조의 상위 계층에서 하위 계층으로 이루어지고, 위임받은 대리서명자들 중에서 서명에 참여할 수 없는 대리서명자는 다시 자신의 하위 계층 참가자들에게 개별 위임을 수행할 수 있도록 함으로써, 반복적 권한 위임을 허용한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1693-1701
• /
• 2010

In this paper, requirements of efficient group key creation in multiple hierarchy structure environment with clear distinction of hierarchical roles within organizations are explained and the method of creating a group key that satisfies such requirements is proposed. The proposed method creates the group key through logical sum operation of hierarchy identifier created using uni-directional hash chain and group identifier randomly created according to the access right. The problem of excessive possession of key information by upper group users in the existing static group key creation technique was resolved. At the same time, lower group users were prevented from deducing key information of upper group users. In addition, as a result of comparative analysis performed with an experiment on existing super group key creation technique and multiple hierarchy group key method, the proposed method was found to be equivalent or superior to existing method in terms of various items including the total number of keys created, the number of keys possessed by users, the number of keys used for encoding and decoding of information, and expandability of keys.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.465-472
• /
• 2004

Proxy signatures is a signature scheme that an original signer delegates one's signature capability to a proxy signer, and then the proxy signer creates a signature on behalf of the original signer. Delegation of authority is a common practice in the real world, in particular, it happens naturally in hierarchical groups such as company, bank and army, etc. In this paper, we propose a new dynamic multi-proxy signature scheme allowing repetitive delegations in a hierarchical group. We adopt multi-proxy signatures to enhance the security of proxy signature. In multi-proxy signatures, plural proxy signers can generate a valid proxy signature collectively on behalf of one original signer. In our scheme, the proxy group is not fixed but constructed dynamically according to some situations. Delegations are processed from higher level to lower level in the hierarchy using delegation tickets. When the original signer wants to delegate one's signature authority, the original signer generates a delegation ticket based on secret sharing and Diffie-Hellman problems. The delegation ticket is shared among proxy signers and then all the proxy signers can generate a valid proxy signature collectively by reconstructing the original signer's delegation ticket. If a certain proxy signer can not attend the proxy signature generating protocol, the proxy signer can also delegate repetitively his partial signature authority to the lower level participants, and then the proxies are constructed dynamically.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.194-196
• /
• 2019

컨소시엄 블록체인은 허가된 멤버로 구성된 여러그룹이 하나의 원장을 공유한다. 이때 하위멤버의 트랜잭션 및 멤버 인증은 블록생성에 참여하는 신뢰된 노드로부터 유효성을 검증받는다. 따라서 컨소시엄 블록체인의 그룹 간 멤버의 트랜잭션 공유는 Privacy문제를 야기한다. 본 논문에서 컨소시엄 블록체인에서의 privacy를 위해 익명신용장기반의 익명프로토콜을 제안한다. 본 제안 방식은 다중블룸필터를 이용하여 긍정오류율을 높이고 효율적으로 검색하도록 한다. 또한 Blind Signature를 통해 컨소시엄 멤버간 메시지에 대한 익명성을 보존하면서 인증에 대한 서명은 유지하도록 한다. 결과적으로 컨소시엄 멤버 간 Privacy를 보존하면서 인증 트랜잭션을 블룸필터의 다중패턴으로 검증하여 컨소시엄 블록체인에서의 익명프로토콜(Anonymous protocol)을 제안한다. 이로써 컨소시엄 블록체인에서의 신뢰기반의 서버 시스템의 확장과 privacy 향상을 제공한다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.487-493
• /
• 2003

A secret sharing scheme is a cryptographic Protocol that a dealer distributes shares about a secret to many participants and authorized subsets of the participants can reconstruct the secret. Secret sharing schemes that reflect various access structure were proposed. We propose a new reusable secret sharing scheme in a hierarchical group. Participants have priority about restoration of secret from high position level of tree. And when participants who belong in high position level are absent, they can delegate restoration competence of the secret transmitting delegation ticket to child nodes that it belongs in low rank level. By participants reuse own share and take part in different secret restoration, they who belong on hierarchical group can be possible different secret restoration by each participant's single share.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.747-754
• /
• 2002

We propose a Web-based collaborative CAD system which is independent from any platforms, and develop a 3D solid modeler in the system. We developed a new prototype of 3D solid modeler based on the web using Java 3D API, which could be executed without any 3D graphics software and worked collaboratively interacting with each user. The modeler can create primitive objects and get various 3D objects by using loader. The interactive control is available to manipulate-objects such as picking, translating, rotating, zooming. Users connect to this solid modeler and they can create 3D objects and modify them as they want. When this solid modeler is imported to collaborative design system, it will be proved its real worth in today's CAD system. Moreover, if we improve this solid modeler adding to the 3D graphic features such as rendering and animation, it will be able to support more detail design and effect view.

• Journal of Intelligence and Information Systems
• /
• v.29 no.2
• /
• pp.241-265
• /
• 2023

A corporate insolvency prediction model serves as a vital tool for objectively monitoring the financial condition of companies. It enables timely warnings, facilitates responsive actions, and supports the formulation of effective management strategies to mitigate bankruptcy risks and enhance performance. Investors and financial institutions utilize default prediction models to minimize financial losses. As the interest in utilizing artificial intelligence (AI) technology for corporate insolvency prediction grows, extensive research has been conducted in this domain. However, there is an increasing demand for explainable AI models in corporate insolvency prediction, emphasizing interpretability and reliability. The SHAP (SHapley Additive exPlanations) technique has gained significant popularity and has demonstrated strong performance in various applications. Nonetheless, it has limitations such as computational cost, processing time, and scalability concerns based on the number of variables. This study introduces a novel approach to variable selection that reduces the number of variables by averaging SHAP values from bootstrapped data subsets instead of using the entire dataset. This technique aims to improve computational efficiency while maintaining excellent predictive performance. To obtain classification results, we aim to train random forest, XGBoost, and C5.0 models using carefully selected variables with high interpretability. The classification accuracy of the ensemble model, generated through soft voting as the goal of high-performance model design, is compared with the individual models. The study leverages data from 1,698 Korean light industrial companies and employs bootstrapping to create distinct data groups. Logistic Regression is employed to calculate SHAP values for each data group, and their averages are computed to derive the final SHAP values. The proposed model enhances interpretability and aims to achieve superior predictive performance.

• Journal of Korean Society of Forest Science
• /
• v.101 no.4
• /
• pp.640-647
• /
• 2012

A metabolomic study was conducted to identify key metabolic components, which are correlated with the growth of 4-year-old Pinus koraiensis seedlings harvested at actively height growing season (May 18th). Among 105 individual metabolites identified by GC/MS analysis, alanine, threonine, oleic acid, and butanoic acids were negatively correlated with both height and weight of 4-year-old seedlings, while malic acid, xylose, glucose, d-turanose and inositol had positive correlation with various growth parameters. During the actively growing season, the concentrations of both amino acids and organic acids in the main stem of Superior seedling group were lower but the photosynthates such as mono-saccharide and sucrose were higher than in other seedling groups such as Intermediate and Inferior. Interestingly, d-turanose, an analogue of sucrose that is not metabolized in higher plants but used as carbon source by many organisms including numerous species of bacteria and fungi, showed the highest correlation (r=0.896, p<0.001) with height of 4-year-old seedlings, indicating that possible interaction with mycorrhizal organisms. Therefore we suggest that several metabolites selected in this study may be used as metabolic markers for complex traits in P. koraiensis.