30809053
Vulnerability Assessment Simulation for Information Infrastructure Protection
The main contribution of this research is to present the method that make it possible to assess the vulnerability in the information infrastructure using simulation technology. To construct the vulnerability assessment simulation system, we make use of the knowledge-based simulation modeling methodology and we designed expressions to estimate the degree of vulnerability of host. Also, we show newly defined vulnerability analysis method that is applicable to vulnerability assessment simulation system. As research results, the vulnerability assessment simulation system and VDBFS(Vulnerability DataBase For Simulator) are constructed.
14176330
System Specification Based Network Modeling for Survivability Testing Simulation
As the structure and behavior of computer network becomes complicated and unpredictable, it becomes difficult to test the survivability of network. The modeling and simulation is a widely used approach to predict the behavior of system or set of system. In this research, we apply a modeling methodology to construct the valid model of computer network focusing on its vulnerability for survivability testing. To accomplish our aim, the appropriate modeling method should be defined. Especially, we take advantage of the system specification based modeling approach to construct valid network model.
47477578
DMKB : A Defense Mechanism Knowledge Base
The major cause of the internet incidents is the vulnerability, which is usually exploited by human attackers or worm virus. Thus the implementation of database on vulnerability is most valuable. If vulnerability is found newly, its information can be included in this database. The contemporary vulnerability databases, however, show weakness in describing countermeasures, although they are practically useful in removing or avoiding vulnerability. This comes from the lack of the analysis process on both semantics and patterns for countermeasures. In this paper, we defined the countermeasures in view of defense mechanism and suggested their representation schemes. In semantics, defense mechanisms can be classified into prevention, detection, recovery and tolerance. And they can be expressed in patterns as the composition of aim, condition, and action. Considering these features, we implemented a knowledge base on defense mechanism – DMKB. By using DMKB, users can get almost whole knowledge with keyword searching under GUI. Our DMKB can be utilized in automatic security testing and management for a given system.
2343440
Component-based LDA Face Descriptor for Image Retrieval
We present a component-based face descriptor with LDA (Linear Discriminant Analysis) and a simple pose classification. Our algorithm has been developed to deal with face image retrieval in huge database such as those in internet environments. Such retrieval requires a compact face descriptor and an efficient recognition algorithm that is robust to variations in lighting and facial poses. Partitioning of a face image into components facilitates the development of an efficient and robust algorithm as follows. First, compensation for light and pose variations is much more easily done on individual components than on the whole image. Second, pose variation is compensated by classifying facial pose and aligning facial components. Finally, LDA is more effective at the component level which has simplified statistics than the whole image. Experimental results on MPEG-7 database show an impressive accuracy of our algorithm compared with conventional LDA methods.
1170029
Toward a secure public-key blockwise fragile authentication watermarking
In this paper, we describe some weaknesses of public-key blockwise fragile authentication watermarkings and the means to make them secure. Wong's (1998) original algorithm is not secure against a mere block cut-and-paste or the well-known birthday attack. To make it secure, some schemes have been proposed to make the signature of each block depend on the contents of its neighboring blocks. We attempt to maximize the change localization resolution using only one dependency per block with a scheme we call hash block chaining version 1 (HBC1). We then show that HBC1, as well as any neighbor-dependent scheme, are susceptible to another forgery technique that we have named a transplantation attack. We also show a new kind of birthday attack that can be effectively mounted against HBC1. To thwart these attacks, we propose using a nondeterministic digital signature together with a signature dependent scheme (HBC2). Finally, we discuss the advantages of using discrete logarithm signatures instead of RSA for watermarking.
18707877
An efficient debugging method for message-based parallel programs using static analysis information
Guaranteeing reproducibility and minimizing probe effects are major issues in the parallel program debugging. The paper suggests a new debugging method, called the Detect and Reproduce method, for message-based parallel programs. The proposed method is designed to guarantee the reproducible behaviors of a target program and to alleviate probe effects by reducing both the number of the probes to be inserted into a program and the amount of information gathered by those probes. The proposed method achieves such effects by employing a static analysis technique to detect nondeterminacy. By detecting nondeterminacy before running the program, only a small number of probes are required to assure reproducibility. To analyze message-based programs statically, an MHB (minimal happened before) model is designed to catch the synchronization structures and algorithms have been developed to locate nondeterminacy based on the MHB model. Utilizing the analysis results, probes are inserted only into the places where nondeterminacy is likely to take place.
4633793
Independent component analysis in a local facial residue space for face recognition
In this paper, we propose an Independent Component Analysis (ICA) based face recognition algorithm, which is robust to illumination andpose variation. Generally, it is well known that the 5rst few eigenfaces represent illumination variation rather than identity. Most Principal Component Analysis (PCA) based methods have overcome illumination variation by discarding the projection to a few leading eigenfaces. The space spanned after removing a few leading eigenfaces is called the “residual face space”. We found that ICA in the residual face space provides more e9cient encoding in terms of redundancy reduction androbustness to pose variation as well as illumination variation, owing to its ability to represent non-Gaussian statistics. Moreover, a face image is separatedinto several facial components, local spaces, andeach local space is representedby the ICA bases (independent components) of its corresponding residual space. The statistical models of face images in local spaces are relatively simple andfacilitate classi5cation by a linear encoding. Various experimental results show that the accuracy of face recognition is signi5cantly improvedby the proposedmethodunder large illumination andpose variations.
15273022
Open Location-Based Service Using Secure Middleware Infrastructure in Web Services
Location-based services or LBS refers to value-added service by processing information utilizing mobile user location. For this kind of LBS, the role of security service is very important in the LBS that store and manage the location information of mobile devices and support various application services using those location information. And in all phases of these functions that include acquisition of location information, storage and management of location information, user management including authentication and information security, and management of the large-capacity location information database, safe security service must be provided. We show the security methods for open LBS in this paper.