• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.493-502
• /
• 2007

Due to a growing interest in searching and expressing knowledge effectively, knowledge management methods such as Topic Map are becoming more important. Topic Map organizes knowledge that is full of intricate relations, so maintaining and managing Topic Map consistently is very essential. TMCL and other constraint languages have limits as they can check simple constraints but can not support complex constraints like dependence constraints. Current constraint checking systems operating at the application level are also showing an inferiority in performance. In this paper, we extend TMCL based on the characteristics of other constraint languages in the information system field and related fields. We build and propose an RDBMS-based Topic Map constraint checking system to support the extended constraint language effectively. This new system handles complex types of constraints like dependency constraint as well as basic Topic Map constraints present in the TMCL. As the system examines each constraint it uses templates to generate queries for effective checking and overall shows a higher performance level than current systems.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.115-124
• /
• 2006

XML is rapidly becoming technologies for information exchange and representation. It causes many research issues such as semantic modeling methods, security, conversion far interoperability with other models, and so on. Especially, the most important issue for its practical application is how to achieve the interoperability between XML model and relational model. Until now, many suggestions have been proposed to achieve it. However several problems still remain. Most of all, the exiting methods do not consider implicit referential integrity relations, and it causes incorrect data delivery. One method to do this has been proposed with the restriction where one semantic is defined as only one same name in a given database. In real database world, this restriction cannot provide the application and extensibility. This paper proposes a noble conversion (RDB-to-XML) algorithm based on the similarity checking technique. The key point of our method is how to find implicit referential integrity relations between different field names presenting one same semantic. To resolve it, we define an enhanced implicity referentiai integrity relations extraction algorithm based on a widely used ontology, WordNet. The proposed conversion algorithm is more practical than the previous-similar approach.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.497-508
• /
• 2016

With a cloud storage service, data owners can easily access their outsourced data in cloud storage on different devices and at different locations, and can share their data with others. However, as the users no longer physically have possession of their outsourced data and the cloud still facing the existence of internal/external threats, the task of checking the data integrity is formidable. Over recent years, numerous schemes have been proposed to ensure data integrity in an untrusted cloud. However, the existing public auditing schemes use a third-party auditor(TPA) to execute high computation to check data integrity and may still face many security threats. In this paper, we first demonstrate that the scheme proposed by Zhang et al. is not secure against our two threat models, and then we propose a self-certified public auditing scheme to eliminate the security threats and guarantee a constant communication cost. Moreover, we prove the securities of our public auditing scheme under three security models.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.1
• /
• pp.205-214
• /
• 2019

Android uses app cache files to improve app execution performance. However, this optimization technique may raise security issues that need to be examined. In this paper, we present a practical design of "Android app cache manipulation attack" to intentionally modify the cache files of a target app, which can be misused for stealing personal information and performing malicious activities on target apps. Even though the Android framework uses a checksum-based integrity check to protect app cache files, we found that attackers can effectively bypass such checks via the modification of checksum of the target cache files. To demonstrate the feasibility of our attack design, we implemented an attack tool, and performed experiments with real-world Android apps. The experiment results show that 25 apps (86.2%) out of 29 are vulnerable to our attacks. To mitigate app cache manipulation attacks, we suggest two possible defense mechanisms: (1) checking the integrity of app cache files; and (2) applying anti-decompilation techniques.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.86-88
• /
• 2012

코드 포인터 공격을 이용한 제어 흐름은 실행 중에 간접 분기의 무결성을 검사하는 것으로 보호할 수 있다. 간접 분기는 반복되는 목적지 주소로의 분기인 경우가 많지만, 목적지 주소는 실행 시간에만 알 수 있기 때문에 여러 가지 예외적인 상황을 적절히 대처할 방법이 필요하다. 본 논문에서는 동적 이진 계측화를 활용하여 실행 중 발생하는 간접 분기를 분석하고, 수집한 주소들을 빠르게 비교하는데 효과적인 주소 비교 기법들을 제시한다. 또한 각 기법을 비교하여 프로그램에 따라 주소 비교의 효율성을 극대화하는 방안을 모색하였다. 이러한 기법을 통해 간접 분기가 야기하는 여러 문제점에서부터 보안 분야에 이르기 까지 활용 범위를 넓힐 수 있을 것으로 기대한다.

• Journal of KIISE:Software and Applications
• /
• v.26 no.5
• /
• pp.595-603
• /
• 1999

최근 많이 부각되고 있는 여러 데이터베이스 응용들은 복잡하고 많은 무결정 규칙을 요구한다. 이러한 응용에서 갱신 트랜잭션은 많은 양의 무결성 규칙을 동반하며 시스템 고장시 많은 수의 트랜잭션이 검사 단계에 있을 경우가 증가하여 철회될 가능성이 높아지낟. 그러나 일반적으로 대부분의 트랜잭션 수행은 무결성 제약 규칙을 만족하므로, 무결성 검사를 통과하여 완료될 트랜잭션을 시스템 고장 회복시에 철회시키는 것은 물론 시스템의 자원을 낭비하는 결과를 초래하게 된다. 이에 본 논문에서는 이러한 트랜잭션이 가지는 성질을 이용하여 , 시스템 고장 시에도 철회되지 않고 계속해서 남은 작업을 수행하고 종료될 수 있도록 하는 방법을 제시하고 실험을 통해 제안한 방법의 효용성을 보였다.

• The Journal of Society for e-Business Studies
• /
• v.2 no.1
• /
• pp.79-94
• /
• 1997

Commerce activities which are free form space and time constraint using a communication network are called Electronic Commerce(EC). Because of sending a commercial information using open network such as Internet in EC, they need the security of commerce information (payment information and purchase information), checking the integrity of transferring data and certifying all parts participated in commerce for a secure commerce. Recently Visa and MasterCard Co. released the Secure Electronic Transaction (SET) Protocol for secure payment card transaction on Internet. This paper proposes a Secure Electronic Commerce Transaction Model(SECTM) using SET in order to support the secure commerce on Internet. The proposed transaction model prevents merchant from abusing the cardholder's payment information (credit-card number etc.) and enables cardholder to shop securely in Electronic Shopping Mall.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.703-705
• /
• 2003

파일 무결성 검사는 시스템 자원의 안정성 여부를 판단할 수 있는 가장 확실한 방법이지만, 감사가 이루어질 때마다 매번 모든 데이터를 검사해야 하며, 관리자의 역량에 않은 부분을 의존하였다. 이는 최대한 빠른 대응을 요하는 침입 복구 시스템에 적합하지 않다. 또한 손상 자원의 복구에 필요한 자원의 상태 정보는 수집 가능하지만, 침입을 차단하기 위해서 침입 행위 주체에 대한 정보는 수집할 수 없다. 위의 두가지 문제를 해결하기 위해 파일 무결성 검사와 시스템 호출 감시 기법을 연동한다. 시스템 호출 강시를 통해서 자원에 대한 침입 행위 주체의 정보를 수집하고 파일 무결성 검사를 하여, 침입 차단 및 복구를 위한 감사 자료를 수집한다. 또한 보다 효과적으로 침입을 탐지하고 복구하기 위하여 여러 침입 탐지 시스템과 연동하여 침입 복구 시스템을 구성할 수 있도록 탐지 메시지를 IDMEF 형식으로 보고한다.

• Korean Journal of Construction Engineering and Management
• /
• v.23 no.3
• /
• pp.45-55
• /
• 2022

BIM models allow building spaces to be instantiated and recognized as unique objects independently of model elements. These instantiated spaces provide the required semantics that can be leveraged for building code checking, energy analysis, and evacuation route analysis. However, theses spaces or rooms need to be designated manually, which in practice, lead to errors and omissions. Thus, most BIM models today does not guarantee the semantic integrity of space designations, limiting their potential applicability. Recent studies have explored ways to automate space allocation in BIM models using artificial intelligence algorithms, but they are limited in their scope and relatively low classification accuracy. This study explored the use of Graph Convolutional Networks, an algorithm exclusively tailored for graph data structures. The goal was to utilize not only geometry information but also the semantic relational data between spaces and elements in the BIM model. Results of the study confirmed that the accuracy was improved by about 8% compared to algorithms that only used geometric distinctions of the individual spaces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5039-5061
• /
• 2017

Cloud storage becomes a new trend that more and more users move their data to cloud storage servers (CSSs). To ensure the security of cloud storage, many cloud auditing schemes are proposed to check the integrity of users' cloud data. However, most of them are based on public key infrastructure, which leads to complex certificates management and verification. Besides, most existing auditing schemes are inefficient when user uploads a large amount of data or a third party auditor (TPA) performs auditing for multiple users' data on different CSSs. To overcome these problems, in this paper, we propose an efficient and secure auditing scheme based on identity-based cryptography. To relieve user's computation burden, we introduce a proxy, which is delegated to generate and upload homomorphic verifiable tags for user. We extend our auditing scheme to support auditing for dynamic data operations. We further extend it to support batch auditing in multiple users and multiple CSSs setting, which is practical and efficient in large scale cloud storage system. Extensive security analysis shows that our scheme is provably secure in random oracle model. Performance analysis demonstrates that our scheme is highly efficient, especially reducing the computation cost of proxy and TPA.