• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.6
• /
• pp.1519-1534
• /
• 2017

Data de-identification is the one of the technique that preserves individual data privacy and provides useful information of data to the analyst. However, original de-identification techniques like k-anonymity have vulnerabilities to background knowledge attacks. On the contrary, differential privacy has a lot of researches and studies within several years because it has both strong privacy preserving and useful utility. In this paper, we analyze various models based on differential privacy and formalize a differentially private model on financial data. As a result, we can formalize a differentially private model on financial data and show that it has both security guarantees and good usefulness.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.447-454
• /
• 2010

This paper presents multiple fuzzy prediction systems based on an Interval type-2 TSK fuzzy Logic System so that the uncertainty and the hidden characteristics of nonlinear data can be reflected more effectively to improve prediction quality. In proposed method, multiple fuzzy systems are adopted to handle the nonlinear characteristics of data, and each of multiple system is constructed by using interval type-2 TSK fuzzy logic because it can deal with the uncertainty and the characteristics of data better than type-1 TSK fuzzy logic and other methods. For input of each system, the first-order difference transformation method are used because the difference data generated from it can provide more stable statistical information to each system than the original data. Finally, computer simulations are performed to show the effectiveness of the proposed method for two typical time series examples.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.17-25
• /
• 2008

The differential power attack (DPA)[8] is a very powerful side-channel attack tool against various cryptosystems and the masking method[10] is known to be one of its algorithmic countermeasures. But it is non-trivial to apply the masking method to non-linear functions, especially, to arithmetic adders. This paper proposes simple and efficient masking methods applicable to arithmetic adders. For this purpose, we use the fact that every combinational logic circuit (including the adders) can be decomposed into basic logic gates (AND, OR, NAND, NOR, XOR, XNOR, NOT) and try to devise efficient masking circuits for these basic gates. The resulting circuits are then applied to the arithmetic adders to get their masking algorithm. As applications, we applied the proposed masking methods to SEED and SHA-1 in hardware.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.27-38
• /
• 1999

We study on the security for the block ciphers with 20block structure which have provable security against DC and LC on the view point of higher order DC, 2-block structures are classified three types according to the location of round function such as C(Center)-type R(Right)-type and L(Left)-type We prove that in the case of 4 rounds encryption function these three types provide the equal strength against higher order DC and that in the case of 5 or more rounds R-type is weaker than C-type and L-type.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.33-41
• /
• 2012

A differential fault analysis(DFA) is one of the most important side channel attacks on block ciphers. Most block ciphers, such as DES, AES, ARIA, SEED and so on., have been analysed by this attack. PRESENT is a 64-bit block cipher with 80/128-bit secret keys and has a 31-round SP-network. So far, several DFAs on PRESENT have been proposed. These attacks recovered 80, 128-bit secret keys of PRESENT with 8~64 fault injections. respectively. In this paper, we propose an improved DFA on PRESENT-80/128. Our attack can reduce the complexity of exhaustive search of PRESENT-80(resp. 128) to on average 1.7(resp. $2^{22.3}$) with 2(resp. 3) fault injections, From these results, our attack results are superior to known DFAs on PRESENT.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.4
• /
• pp.17-24
• /
• 2010

A differential fault attack(DFA) is one of the most efficient side channel attacks on block ciphers. Almost all block ciphers, such as DES, AES, ARIA, SEED and so on., have been analysed by this attack. In the case of the known DFAs on SEED, the attacker induces permanent faults on a whole left register of round 16. In this paper, we analyse SEED against DFA with differential characteristics and addition-XOR characteristics of the round function of SEED. The fault assumption of our attack is that the attacker induces 1-bit faults on a particular register. By using our attack, we can recover last round keys and the master key with about $2^{32}$ simple arithmetic operations. It can be simulated on general PC within about a couple of second.

• Journal of Broadcast Engineering
• /
• v.27 no.3
• /
• pp.295-307
• /
• 2022

In this paper, we propose a novel compression method for scalable Fisher vectors (SCFV) which is used as a global visual feature description of individual video frames in MPEG CDVA standard. CDVA standard has adopted a temporal descriptor redundancy removal technique that takes advantage of the correlation between global feature descriptors for adjacent keyframes. However, due to the variable length property of SCFV, the temporal redundancy removal scheme often results in inferior compression efficiency. It is even worse than the case when the SCFVs are not compressed at all. To enhance the compression efficiency, we propose an asymmetric SCFV difference computation method and a SCFV reconstruction method. Experiments on the FIVR dataset show that the proposed method significantly improves the compression efficiency compared to the original CDVA Experimental Model implementation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.1D
• /
• pp.203-209
• /
• 2006

SAR (Synthetic Aperture Radar) technology, which is not influenced by cloud cover because of using electromagnetic wave of long wavelength, has an advantage in mapping the earth. NASA, recognizing these strong points of SAR, launched SRTM (Shuttle Radar Topography Mission), and acquired the topographic information of the earth. SRTM and NED (National Elevation Data) of USGS were used for the research and vegetation height map was produced through differentiating the two data. Correlation between SRTM-NED and planting year was analyzed to see the relationship. Strong correlation was detected and it shows the feasibility of estimating timber age and eventually creating timber age map from SRTM-NED. Additional analyses were conducted to check if the linearity is influenced by regional characteristics and forest uniformity. As results, the correlation between SRTM-NED and timber age is influenced by roughness of the terrain. Overall, this paper shows that timber age estimation using SRTM and NED can be sufficiently practical.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.4
• /
• pp.445-454
• /
• 2001

This paper is to study elasto-plastic behavior of shear deformed braced frames. Two types of frames are considered , X-type and K-type. The slenderness ratio has been used in the parametric study. The stress-strain curve is assumed tri-linear model, and considered the strain hardening range. The finite difference method is used to solve the load-displacement relationship of the braced frames. For the elastic slope and maximum load, experimental results are compared with theoretical results and its difference remains less than 10%. Therefore suggested method in this paper is reasonable.

• Journal of computational fluids engineering
• /
• v.4 no.1
• /
• pp.8-18
• /
• 1999

In devising a numerical approximation for the convective spatial transport of a fluid mechanical quantity, it is noted that the convective motion of a scalar quantity occurs in one-way, or from upstream to downstream. This consideration leads to a new scheme termed a pure upwind difference scheme (PUDS) in which an estimated value for a fluid mechanical quantity at a control surface is not influenced from downstream values. The formal accuracy of the proposed scheme is third order accurate. Two typical benchmark problems of a wall-driven fluid flow in a square cavity and a buoyancy-driven natural convection in a tall cavity are computed to evaluate performance of the proposed method. for comparison, the widely used simple upwind scheme, power-law scheme, and QUICK methods are also considered. Computation results are encouraging: the proposed PUDS sensitized to the convection direction produces the least numerical diffusion among tested convection schemes, and, notable improvements in representing recirculation of fluid stream and spatial change of a scalar. Although the formal accuracy of PUDS and QUICK are the same, the accuracy difference of approximately a single order is observed from the revealed results.