• Title/Summary/Keyword: signature hierarchy

Search Result 15, Processing Time 0.021 seconds

Fragile Watermarking for Image Authentication and Detecting Image Modification (영상 인증과 변형 검출을 위한 Fragile 워터마킹)

  • Woo, Chan-Il;Jeon, Se-Gil
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.3
    • /
    • pp.459-465
    • /
    • 2009
  • Digital watermarking is a technique to insert a visually imperceptible information into an image so that the information can be extracted for the purposes of ownership verification or authentication. And watermarking techniques can be classified as either fragile or robust. Robust watermarks are useful for copyright and ownership assertion purposes. They cannot be easily removed and should resist common image manipulation procedures such as rotation, scaling, cropping, etc. On the other hand, fragile watermarks are easily corrupted by any image processing procedure, it can detect any change to an image as well as localizing the areas that have been changed. In this paper, we propose a fragile watermarking algorithm using a special hierarchical structure for integrity verification of image and detection of manipulated location. In the proposed method, the image to be watermarked is divided into blocks in a multi-level hierarchy and calculating block digital signatures in this hierarchy. The proposed method thwarts the cut-and-paste attack and the experimental results to demonstrate the effectiveness of the proposed method.

  • PDF

The Effectiveness Evaluation Methods of DDoS Attacks Countermeasures Techniques using Simulation (시뮬레이션을 이용한 DDoS공격 대응기술 효과성평가방법)

  • Kim, Ae-Chan;Lee, Dong-Hoon;Jang, Seong-Yong
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.3
    • /
    • pp.17-24
    • /
    • 2012
  • This paper suggests Effectiveness Evaluation Methods of DDoS attacks countermeasures model by simulation. According to the security objectives that are suggested by NIST(National Institute of Standards and Technology), It represents a hierarchical Effectiveness Evaluation Model. we calculated the weights of factors that security objectives, security controls, performance indicator through AHP(Analytic Hierarchy Process) analysis. Subsequently, we implemented Arena Simulation Model for the calculation of function points at the performance indicator. The detection and protection algorithm involve methods of critical-level setting, signature and anomaly(statistic) based detection techniques for Network Layer 4, 7 attacks. Proposed Effectiveness Evaluation Model can be diversely used to evaluate effectiveness of countermeasures and techniques for new security threats each organization.

Study of Pre-Filtering Factor for Effectively Improving Dynamic Malware Analysis System (동적 악성코드 분석 시스템 효율성 향상을 위한 사전 필터링 요소 연구)

  • Youn, Kwang-Taek;Lee, Kyung-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.3
    • /
    • pp.563-577
    • /
    • 2017
  • Due to the Internet and computing capability, new and variant malware are discovered around 1 Million per day. Companies use dynamic analysis such as behavior analysis on virtual machines for unknown malware detection because attackers use unknown malware which is not detected by signature based AV effectively. But growing number of malware types are not only PE(Portable Executable) but also non-PE such as MS word or PDF therefore dynamic analysis must need more resources and computing powers to improve detection effectiveness. This study elicits the pre-filtering system evaluation factor to improve effective dynamic malware analysis system and presents and verifies the decision making model and the formula for solution selection using AHP(Analytics Hierarchy Process)

COSMOLOGY WITH MASSIVE NEUTRINOS: CHALLENGES TO THE STANDARD ΛCDM PARADIGM

  • ROSSI, GRAZIANO
    • Publications of The Korean Astronomical Society
    • /
    • v.30 no.2
    • /
    • pp.321-325
    • /
    • 2015
  • Determining the absolute neutrino mass scale and the neutrino mass hierarchy are central goals in particle physics, with important implications for the Standard Model. However, the final answer may come from cosmology, as laboratory experiments provide measurements for two of the squared mass differences and a stringent lower bound on the total neutrino mass - but the upper bound is still poorly constrained, even when considering forecasted results from future probes. Cosmological tracers are very sensitive to neutrino properties and their total mass, because massive neutrinos produce a specific redshift-and scale-dependent signature in the power spectrum of the matter and galaxy distributions. Stringent upper limits on ${\sum}m_v$ will be essential for understanding the neutrino sector, and will nicely complement particle physics results. To this end, we describe here a series of cosmological hydrodynamical simulations which include massive neutrinos, specifically designed to meet the requirements of the Baryon Acoustic Spectroscopic Survey (BOSS) and focused on the Lyman-${\alpha}$ ($Ly{\alpha}$) forest - also a useful theoretical ground for upcoming surveys such as SDSS-IV/eBOSS and DESI. We then briefly highlight the remarkable constraining power of the $Ly{\alpha}$ forest in terms of the total neutrino mass, when combined with other state-of-the-art cosmological probes, leaving to a stringent upper bound on ${\sum}m_v$.

Extraction of Classes and Hierarchy from Procedural Software (절차지향 소프트웨어로부터 클래스와 상속성 추출)

  • Choi, Jeong-Ran;Park, Sung-Og;Lee, Moon-Kun
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.612-628
    • /
    • 2001
  • This paper presents a methodology to extract classes and inheritance relations from procedural software. The methodology is based on the idea of generating all groups of class candidates, based on the combinatorial groups of object candidates, and their inheritance with all possible combinations and selecting a group of object candidates, and their inheritance with all possible combinations and selecting a group with the best or optimal combination of candidates with respect to the degree of relativity and similarity between class candidates in the group and classes in a domain model. The methodology has innovative features in class candidates in the group and classes in a domain model. The methodology has innovative features in class and inheritance extraction: a clustering method based on both static (attribute) and dynamic (method) clustering, the combinatorial cases of grouping class candidate cases based on abstraction, a signature similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement, that is, the horizontal measurement for overall group similarity between n class candidates and m classes, and the vertical measurement for specific similarity between a set of classes in a group of class candidates and a set of classes with the same class hierarchy in a domain model, etc. This methodology provides reengineering experts with a comprehensive and integrated environment to select the best or optimal group of class candidates.

  • PDF