• 한국정보관리학회:학술대회논문집
• /
• 한국정보관리학회 2005년도 제12회 학술대회 논문집
• /
• pp.125-132
• /
• 2005

본 연구는 공공기관에서 생산되는 기록물로서 가장 일반적이고 대표적인 공문서의 장기보존과 접근을 위한 상호운용성을 갖춘 보존 메타데이터 요소를 설정하는데 그 목적이 있다. 구체적으로는 기록물관리 표준인 ISO 15489에서 제안하는 메타데이터 요소와 우리나라의 메타데이터 요소의 비교분석을 통해 전자문서관리시스템의 최고 핵심인 공문서의 보존 메타데이터 항목을 연구하였다. 이는 향후 우리나라 환경에 적합한 표준화된 기록물 보존 메타데이터를 구축하는데 유용한 기초 자료로 활용할 수 있을 것이다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 추계학술발표대회
• /
• pp.1131-1134
• /
• 2007

본 논문에서는 랜덤대치(random substitution) 기법에 대하여 심도 있는 분석을 실시한다. 랜덤대치 기법의 효율적인 구현을 위하여 데이터 재구축(reconstruction) 과정에서 필요로 하는 역행렬을 구하는 공식을 제시한다. 또한, 랜덤대치에 사용되는 다양한 파라미터들의 의미를 실험적으로 밝혀내며, 정확도와 프라이버시를 합리적으로 측정할 수 있는 새로운 측도(measure)들을 제안한다.

• Journal of Information Processing Systems
• /
• 제14권2호
• /
• pp.552-562
• /
• 2018

With the advent of the information society, image restoration technology has aroused considerable interest. Guided image filtering is more effective in suppressing noise in homogeneous regions, but its edge-preserving property is poor. As such, the critical part of guided filtering lies in the selection of the guided image. The result of the Expected Patch Log Likelihood (EPLL) method maintains a good structure, but it is easy to produce the ladder effect in homogeneous areas. According to the complementarity of EPLL with guided filtering, we propose a method of coupling EPLL and guided filtering for image de-noising. The EPLL model is adopted to construct the guided image for the guided filtering, which can provide better structural information for the guided filtering. Meanwhile, with the secondary smoothing of guided image filtering in image homogenization areas, we can improve the noise suppression effect in those areas while reducing the ladder effect brought about by the EPLL. The experimental results show that it not only retains the excellent performance of EPLL, but also produces better visual effects and a higher peak signal-to-noise ratio by adopting the proposed method.

• Journal of Information Science Theory and Practice
• /
• 제10권spc호
• /
• pp.143-153
• /
• 2022

With the development of networks and the increase in the number of network devices, the number of cyber attacks targeting them is also increasing. Since these cyber-attacks aim to steal important information and destroy systems, it is necessary to minimize social and economic damage through early detection and rapid response. Many studies using machine learning (ML) and artificial intelligence (AI) have been conducted, among which payload learning is one of the most intuitive and effective methods to detect malicious behavior. In this study, we propose a preprocessing method to maximize the performance of the model when learning the payload in term units. The proposed method constructs a high-quality learning data set by eliminating unnecessary noise (stopwords) and preserving important features in consideration of the machine language and natural language characteristics of the packet payload. Our method consists of three steps: Preserving significant special characters, Generating a stopword list, and Class label refinement. By processing packets of various and complex structures based on these three processes, it is possible to make high-quality training data that can be helpful to build high-performance ML/AI models for security monitoring. We prove the effectiveness of the proposed method by comparing the performance of the AI model to which the proposed method is applied and not. Forthermore, by evaluating the performance of the AI model applied proposed method in the real-world Security Operating Center (SOC) environment with live network traffic, we demonstrate the applicability of the our method to the real environment.

• 한국정보처리학회논문지
• /
• 제2권4호
• /
• pp.443-452
• /
• 1995

객체 지향 데이타베이스 시스템은 복잡한 데이타 관리 기능에 대한 응용을 제공하 는 효과적인 해결책으로써 제안되어왔다. 질의 처리와 같은 문제점에 대한 연구와 이 러한 요구를 입증하는 것은 형식적인 객체지향 질의 모델이 없어서 진척되지 못하고 있다. 본 논문은 집단화 상속성에 기반한 질의 모델을 정의하며, 질의의 대수 표현에 서 재작성 규칙을 보존하는 동등성에 적용할 수 있는 의미적 재작성 규칙을 개발한다. 이질의 모델을 의미적으로 분석하여 논리적으로 최적화하고, 질의의 대수식들은 등가 보존 재작성 규칙에 의하여 최적화될 수 있다.

• Journal of Computing Science and Engineering
• /
• 제5권3호
• /
• pp.197-209
• /
• 2011

The increasing popularity of graph data, such as social and online communities, has initiated a prolific research area in knowledge discovery and data mining. As more real-world graphs are released publicly, there is growing concern about privacy breaching for the entities involved. An adversary may reveal identities of individuals in a published graph, with the topological structure and/or basic graph properties as background knowledge. Many previous studies addressing such attacks as identity disclosure, however, concentrate on preserving privacy in simple graph data only. In this paper, we consider the identity disclosure problem in weighted graphs. The motivation is that, a weighted graph can introduce much more unique information than its simple version, which makes the disclosure easier. We first formalize a general anonymization model to deal with weight-based attacks. Then two concrete attacks are discussed based on weight properties of a graph, including the sum and the set of adjacent weights for each vertex. We also propose a complete solution for the weight anonymization problem to prevent a graph from both attacks. In addition, we also investigate the impact of the proposed methods on community detection, a very popular application in the graph mining field. Our approaches are efficient and practical, and have been validated by extensive experiments on both synthetic and real-world datasets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.5189-5208
• /
• 2015

To address the contradiction between data aggregation and data security in wireless sensor networks, a Recoverable Privacy-preserving Integrity-assured Data Aggregation (RPIDA) scheme is proposed based on privacy homomorphism and aggregate message authentication code. The proposed scheme provides both end-to-end privacy and data integrity for data aggregation in WSNs. In our scheme, the base station can recover each sensing data collected by all sensors even if these data have been aggregated by aggregators, thus can verify the integrity of all sensing data. Besides, with these individual sensing data, base station is able to perform any further operations on them, which means RPIDA is not limited in types of aggregation functions. The security analysis indicates that our proposal is resilient against typical security attacks; besides, it can detect and locate the malicious nodes in a certain range. The performance analysis shows that the proposed scheme has remarkable advantage over other asymmetric schemes in terms of computation and communication overhead. In order to evaluate the performance and the feasibility of our proposal, the prototype implementation is presented based on the TinyOS platform. The experiment results demonstrate that RPIDA is feasible and efficient for resource-constrained sensor nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2407-2426
• /
• 2016

A group signature scheme allows any member to sign on behalf of a group. It is applied to practical distributed security communication environments, such as privacy-preserving, data mining. In particular, the excellent features of group signatures, including membership joining and revocation, anonymity, traceability, non-frameability and controllable linkability, make group signature scheme more attractive. Among these features, non-frameability can guarantee that a member's signature cannot be forged by any other (including issuer), and controllable linkability supports to confirm whether or not two group signatures are created by the same signer while preserving anonymity. Until now, only Hwang et al.'s group schemes (proposed in 2013 and 2015) can support all of these features. In this paper, we present a new dynamic group signature scheme which can achieve all of the above excellent features. Compared with their schemes, our scheme has the following advantages. Firstly, our scheme achieves more efficient membership revocation, signing and verifying. The cost of update key in our scheme is two-thirds of them. Secondly, the tracing algorithm is simpler, since the signer can be determined without the judging step. Furthermore, in our scheme, the size of group public key and member's private key are shorter. Lastly, we also prove security features of our scheme, such as anonymity, traceability, non-frameability, under a random oracle model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.4226-4241
• /
• 2014

Cloud storage provides an easy, cost-effective and reliable way of data management for users without the burden of local data storage and maintenance. Whereas, this new paradigm poses many challenges on integrity and privacy of users' data, since users losing grip on their data after outsourcing the data to the cloud server. In order to address these problems, recently, Worku et al. have proposed an efficient privacy-preserving public auditing scheme for cloud storage. However, in this paper, we point out the security flaw existing in the scheme. An adversary, who is on-line and active, is capable of modifying the outsourced data arbitrarily and avoiding the detection by exploiting the security flaw. To fix this security flaw, we further propose a secure and efficient privacy-preserving public auditing scheme, which makes up the security flaw of Worku et al.'s scheme while retaining all the features. Finally, we give a formal security proof and the performance analysis, they show the proposed scheme has much more advantages over the Worku et al.'s scheme.

• 한국산업정보학회논문지
• /
• 제6권4호
• /
• pp.75-80
• /
• 2001

본 논문에서는 복잡한 하이퍼카오스 신호를 발생시키는 HVPM(Hyperchaotic Volume Preserving Maps) 모델을 이용한 카오스 동기화 알고리즘을 제안하고자 한다. 제안한 HVPM 모델은 3차원 이산시간(discrete-time) 연립 차분방정식으로 구성되어 있으며, 비선형 사상(maps)과 모듈러(modulus) 함수를 사용하여 랜덤한 카오스 어트랙터(attractor)를 발생시킨다. Pecora와 Caroll은 최근 카오스 시스템이 카오스 신호를 이용하여 동기화가 가능하다고 보고하였다. 따라서 본 논문에서는 하이퍼카오스 신호를 발생시키는 HVPM 모델간의 동기화를 위하여 결합동기(coupled synchronization) 알고리듬을 제안하였다. 모의실험에서 카오스 시스템과 하이퍼카오스 신호를 결합하여 카오스 동기화 현상을 확인할 수 있었다.