• Journal of Internet Computing and Services
• /
• v.19 no.3
• /
• pp.67-77
• /
• 2018

This paper suggests that LOD establishes its own link policy and publishes it to LOD cloud to provide identity among entities in different LODs. For specifying the link policy, we proposed vocabulary set founded on RDF model as well. We implemented Policy based In-depth Searching and Cleansing(PISC for short) system that proceeds in-depth searching across LODs by referencing the link policies. PISC has been published on Github. LODs have participated voluntarily to LOD cloud so that degree of the entity identity needs to be evaluated. PISC, therefore, evaluates the identities and cleanses the searched entities to confine them to that exceed user's criterion of entity identity level. As for searching results, PISC provides entity's detailed contents which have been collected from diverse LODs and ontology customized to the content. Simulation of PISC has been performed on DBpedia's 5 LODs. We found that similarity of 0.9 of source and target RDF triples' objects provided appropriate expansion ratio and inclusion ratio of searching result. For sufficient identity of searched entities, 3 or more target LODs are required to be specified in link policy.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.633-642
• /
• 2006

In the Internet environment many interactions between many users and unknown users take place and it is usually rare to have the trust information about others. Due to the lack of trust information, entities have to take some risks in transactions with others. In this perspective, it is crucial for the entities to be equipped with functionality to accumulate and manage the trust information on other entities in order to reduce risks and uncertainty in their transactions. This paper is concerned with a quantitative computational trust model which takes into account multiple evaluation criteria and uses the recommendation from others in order to get the trust for an entity. In the proposed trust model, the trust for an entity is defined as the expectation for the entity to yield satisfactory outcomes in the given situation. Once an interaction has been made with an entity, it is assumed that outcomes are observed with respect to evaluation criteria. When the trust information is needed, the satisfaction degree, which is the probability to generate satisfactory outcomes for each evaluation criterion, is computed based on the empirical outcome outcome distributions and the entity's preference degrees on the outcomes. Then, the satisfaction degrees for evaluation criteria are aggregated into a trust value. At that time, the reputation information is also incorporated into the trust value. This paper also shows that the model could help the entities effectively choose other entities for transactions with some experiments in e-commerce.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.642-652
• /
• 2009

In order to improve the performance of the existing relation extraction approaches, we propose a method for combining two pivotal concepts which play an important role in classifying semantic relationships between entities in text. Having built a composite kernel-based relation extraction system, which incorporates both entity features and syntactic structured information of relation instances, we define nine classes of lexical features and synthetically apply them to the system. Evaluation on the ACE RDC corpus shows that our approach boosts the effectiveness of the existing composite kernels in relation extraction. It also confirms that by integrating the three important features (entity features, syntactic structures and contextual lexical features), we can improve the performance of a relation extraction process.

• The KIPS Transactions:PartD
• /
• v.17D no.3
• /
• pp.193-202
• /
• 2010

Recently, there have been several researches on automatic object identification and distributed computing technology to realize a ubiquitous computing environment. Radio Frequency IDentification (RFID) technology has been applied to many business areas to simplify complex processes and gain important benefits. To derive real benefits from RFID, the system must rapidly implement functions to process a large quantity of event data generated by the RFID operations and should be configured dynamically for changing businesses. Consequently, developers are forced to implement systems to derive meaningful high-level events from simple RFID events and bind them to various business processes. Although applications could directly consume and act on RFID events, extracting the business rules from the business logic leads to better decoupling of the system, which consequentially increases maintainability. In this paper, we describe an RFID business aware framework for business processes in the Electronic Product Code (EPC) Network. This framework is proposed for developing business applications using business services. The term "business services" refers to generated events that can be used in business applications without additional data collection and processing. The framework provides business rules related to data collection, processing, and management, and supports the rapid development and easy maintenance of business applications based on business services.

• Review of KIISC
• /
• v.8 no.3
• /
• pp.5-18
• /
• 1998

인터넷을 통한 상거래가 21세기에 중요한 상거래 수단이 될 전망이다. 인터넷 상거래 시스템은 공개키 암호시스템에 바탕을 두고 실현되고 있다. 공개키 암호 시스템의 폭넓은 사용은 사용자 공개키가 신뢰성이 있어야 안전성을 보장받을 수 있다. 공개키 기반 구조는 이를 위하여 구축되어야 한다. 따라서 안전하고 신뢰성 있게 공개키를 관리하고 공표하기 위한 공개키 기반 구조는 인터넷전자상거래 시스템뿐만 아니라 정부 기간 통신망에서도 매우 중요한 역할을 수행할 것이다. 공개키 기반 구조는 기본적으로 공개키를 CA의 서명용 비밀키로 서명한 공개키 인즌서를 활용한다. 본 고에서는 공개키 기반 구조를 정의하고, 공개키 기반 구조에서 사용될 보안 알고리듬을 살펴보며, X.509 인증서 구조와 종류, 보안 알고리듬 및 보안 정책을 식별하기위한 OID(Object ID) 와 통신 개체를 확인하기 위한 X.500 DN(Distinguished Name)를 정의하고, 믿음의 연결 고리인 인증경로, 인증 경로의 검증 방안, 새로운 요구사항인 인증 경로의 제한, 인증서 발행 및 발급을 위한 인증서 정책, 그리고 인증서 관리 방법 등을 인터넷 공개키 구조인 PKIX문서를 중심으로 기술한다. 또한 공개키 기반 구조를 위한 규격을 제시한다.

• Journal of Korean Society of Archives and Records Management
• /
• v.20 no.1
• /
• pp.115-137
• /
• 2020

This study aims to examine the limitations of status that describe archives based on the Archival rules, and to propose a new method using the Records in Context - Conceptual model (RiC-CM) as a solution. Given this, the study conducted literature reviews and case studies. The solutions based on RiC-CM and its effects on the limitations of the existing environment are as follows. First, RiC-CM can describe multiple provenances about archives. This can be solved by defining individual records and provenances as "entity" and expressing their associations as relationships. The interrelation of entities alone can more accurately represent the information of provenances associated with a particular archive, making it easier to identify the overall context that makes records. Second, RiC-CM can link related files. Those that belong to a specific records group (fonds) can be resolved by assigning them to individual entities and making interrelation according to the context that makes records. This method makes it possible to serve information about the context that makes records. From the user's point of view, more options are available for searching records. Third, RiC-CM can link all relevant producer-made records related to a specific production organization. If organizations are related to each other, they can be defined as "entity," and their relationship can be expressed as "associated with." It helps to comprehensively examine the context of provenances. The findings of this study are expected to be used as a basis for future research on RiC-CM, in response to the paradigm shift for electronic records management systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.421-423
• /
• 1998

본 논문에서는 인트라넷환경에서 허가된 사용자만이 개체에 접근할 수 있도록 하기 위하여 역할기반 접근제어 정책을 이용하였다. 이러한 방법은 사용자와 데이터 사이의 권한부여의 복잡성을 감소시킨다. 또한 역할을 지역역할 및 전역역할로 구성하고 접근제어 연산 및 역할의 갱신에 따른 절차를 구현하였다. 구현을 위하여 분산객체 컴퓨팅 환경의 객체 요청중개자 CORBA/ORB를 이용하였다.

• Review of KIISC
• /
• v.19 no.4
• /
• pp.36-43
• /
• 2009

키 교환은 이미 오래전부터 많이 연구되어 왔으나 끊임없이 변화하는 통신 환경과 그에 따른 새로운 위협에 따라 안전한 키 교환이 필요하게 되었다. 특히 키 교환을 수행하는 개체의 비밀키가 노출되었을 경우에도 안전한 키 교환 프로토콜이 필요하다. 또한 그룹의 구성원 수와 상관없이 상수 라운드를 가지는 효율적인 키 교환 프로토콜이 요구된다. 본 논문에서는 ID 기반의 그룹 키 교환 기법에 대한 기술 동향을 분석하고, 그룹 키 교환 환경에서의 다양한 공격 환경 및 공격자에 따른 안전성 모델에 대한 안전성을 분석한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.163-166
• /
• 2002

무선 인터넷 사용의 증가와 함께 PDA 또는 무선단말기와 같은 제한된 시스템 환경에 적합한 보안 서비스의 필요성이 증가되고 있다. 무선환경을 위해 제공되어야 할 다양한 보안 서비스 중 인증 및 키 합의를 위한 과정은 보안상 매우 민감한 부분이다. 안전한 프로토콜 설계에서 통신에 참여하는 개체들에 대한 인증 및 이후 진행되는 해당 세션의 안전성 확보를 위한 세션키 설정, 서비스 사용자에 대한 익명성 보장 등이 고려되어야 한다. 본 논문에서는 무선 인터넷의 한정된 시스템 환경을 고려한 타원 곡선 암호시스템(ECC) 기반의 인증 및 키 합의 프로토콜을 제안한다.

• Review of KIISC
• /
• v.11 no.3
• /
• pp.57-64
• /
• 2001

최근 공개키 암호 시스템의 사용이 급증하면서 공개키의 무결성과 신뢰성 문제를 해결하고자 등장한 인증서기반의 공개키 기반 구조(PKI)와 관련된 다양한 응용프로토콜에 관한 연구가 활발히 진행되고 있다. 본 고에서는 PKI 응용프로토콜 중에서 PKI 개체들간의 인증서관련 메시지 교환 표준인 인증서 관리 프로토콜(Certificate Management Protocols) 을 분석하였다. CMP에 관련된 문서는 IETF에서 표준화한 RFC2510과 2001년 2월에 제안된 드래프트가 있는데, 본 고에 서는 RFC2510을 중점적으로 분석한 후, 드래프트에서 새로 제안된 부분을 추가하여 두 문서를 비교 분석하였다.