• Title/Summary/Keyword: 복제 공격

Search Result 100, Processing Time 0.029 seconds

Automatic Intrusion Response System based on a Self-Extension Monitoring (자기확장 모니터링 기반의 침입자동대응 시스템)

  • Jang, Hee-Jin;Kim, Sang-Wook
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.489-497
    • /
    • 2001
  • In the coming age of information warfare, information security patterns take on a more offensive than defensive stance. It is necessary to develop an active form of offensive approach to security protection in order to guard vital information infrastructures and thwart hackers. Information security products need to support an automatic response facility without human intervention in order to minimize damage to the attacked system and cope with the intrusion immediately. This paper presents an automatic intrusion response model which is developed on a Self-Extension Monitoring. It also proposes an ARTEMIS(Advanced Realtime Emergency Management and Intruder Identification System), which is designed and implemented based on the suggested model. The Self-Extension Monitoring using self-protection and replication minimizes spatial limitations on collection of monitoring information and intruder tracing. It enhances the accuracy of intrusion detection and tracing.

  • PDF

Secure Group Communication Scheme for e-Commerce Based on Mobile Agents (이동에이전트 기반의 전자상거래를 위한 안전한 그룹통신 기법)

  • Cho, Hyun-Jin;Kim, Gu -Su;Eom, Young-Ik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.487-490
    • /
    • 2005
  • 이동 에이전트란 어떠한 동작을 수행하는 명령과 자신의 상태 정보를 포함하는 자율적인 소프트웨어 객체이다. 이동 에이전트는 자율적으로 이동할 수 있으며 복제와 증식이 가능하고 사용자의 업무를 대신해서 수행할 수 있다는 장점으로 인해 전자상거래에서 사용자를 대신하여 상품 검색 및 구매에 사용될 수 있다. 이 때 다수의 이동 에이전트가 하나의 그룹이 되어 서로 메시지를 주고받으며 사용자의 요구사항을 수행한다. 이동 에이전트간 전달되는 메시지는 상품의 정보뿐 아니라 사용자 또는 에이전트의 비밀정보가 될 수 있다. 악의를 가진 외부 개체로부터 그룹 멤버쉽이나 메시지가 변경된다면 이동 에이전트 그룹은 사용자가 의도하지 않는 동작을 수행할 수 있다. 본 논문에서는 이러한 공격을 방어하기 위해 그룹 멤버간 암호화 통신을 할 수 있는 그룹 세션키 생성 기법을 제안한다. 기존 기법과는 달리 본 논문에서는 중앙 키 분배 서버 없이 그룹에 참가하는 이동 에이전트 각자 그룹 세션키를 생성한다. 또한 키 갱신을 주기적으로 수행함으로써 외부 개체로부터 그룹 세션키의 습득을 어렵게 한다.

  • PDF

Threats and countermeasures of malware (악성코드의 위협과 대응책)

  • Lim, Dong Yul
    • Journal of Convergence Society for SMB
    • /
    • v.5 no.1
    • /
    • pp.13-18
    • /
    • 2015
  • The malware, as hackers generic name of executable code that is created for malicious purposes, depending on the presence or absence of a self-replicating ability infected subjects, and are classified as viruses, worms, such as the Trojan horse. Mainly Web page search and P2P use, such as when you use a shareware, has become penetration is more likely to occur in such a situation. If you receive a malware attack, whether the e-mail is sent it is automatically, or will suffer damage such as reduced system performance, personal information leaks. While introducing the current malware, let us examine the measures and describes the contents related to the malicious code.

  • PDF

Blockchain-based Distributed Database System for Efficient Falsification Detection and Reliable Inquiry of Faultless Automobile Driving Information (효율적 위·변조 탐지 및 무결한 차량 운행 정보의 안정적 질의를 위한 블록체인 기반 분산 데이터 관리 방안 연구)

  • Moon, Junoh;Min, Chanki;Lim, Jongmin;Yoon, Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.10a
    • /
    • pp.133-136
    • /
    • 2019
  • 차량에서 생성되는 데이터의 가치가 상승함에 따라 데이터 소스와 데이터 내용에 대한 보안 위협 또한 증가하고 있다. 데이터 소스인 차량의 경우에는 운행의 안정성을 보장하고자 블록체인을 결합하려는 시도가 있어왔지만, 무결한 차량 운행 데이터 관리 시스템에 대한 이해 부족으로 데이터 위·변조 등 차량 데이터에 대한 사이버 공격에 적절히 대응하지 못하고 있다. 이에 본 논문은 수집된 차량 데이터의 무결성을 보장하고 수집된 데이터에 대한 질의가 가능한 블록체인 기반 데이터 베이스 시스템을 제안한다. 본 시스템을 통하여 분산 합의 기반 데이터 무결성 검증, 블록을 구성하는 해시트리의 복제 저장 없이 위·변조된 차량 데이터 검출, 일정 수준의 장애를 허용한 상태 하에서의 질의문 처리 등이 가능해진다. 본 시스템은 높은 공간 효율성과 확장성을 가지며, 수소전기차 공유 업체의 차량 운행 정보를 바탕으로 한 성능 평가 결과 평균적으로 데이터 블록 저장에 4.0 초, 각 블록 검증에 2.4 초, 질의 처리를 위한 합의 과정에 1.3 초가 소요됨을 확인하였다.

A Quantization-adaptive Watermarking Algorithm to Protect MPEG Moving Picture Contents (MPEG 동영상 컨텐츠 보호를 위한 양자화-적응적 워터마킹 알고리즘)

  • Kim Joo-Hyuk;Choi Hyun-Jun;Seo Young-Ho;Kim Dong-Wook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.149-158
    • /
    • 2005
  • This paper proposed a blind watermarking method for video contents which satisfies both the invisibility and the robustness to attacks to prohibit counterfeiting, modification, illegal usage and illegal re-production of video contents. This watermarking algorithm targets MPEG compression system and was designed to control the amount of watermarking to be inserted according to the adaptive quantization scale code to follow the adaptive quantization of the compression system. The inserting positions of the watermark were chosen by considering the frequency property of an image and horizontal, vertical and diagonal property of a $8{\times}8$ image block. Also the amount of watermarking for each watermark bit was decided by considering the quantization step. This algorithm was implemented by C++ and experimented for invisibility and robustness with MPEG-2 system. The experiment results showed that the method satisfied enough the invisibility of the inserted watermark and robustness against attacks. For the general attacks, the error rate of the extracted watermark was less than $10\%$, which is enough in robustness against the attacks. Therefore, this algorithm is expected to be used effectively as a part in many MPEG systems for real-time watermarking, especially in the sensitive applications to the network environments.

PUF-based Secure FANET Routing Protocol for Multi-Drone

  • Park, Yoon-Gil;Lee, Soo-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.9
    • /
    • pp.81-90
    • /
    • 2020
  • In order to operate multi drone efficiently, existing control methods must be improved, and drones must be able to construct communication networks autonomously. FANET(Flying Ad-Hoc Network), which is being considered as an alternative to solving these problems, is based on ad hoc network technology and can be exposed to a variety of security vulnerabilities. However, due to the limited computational power and memory of FANET nodes, and rapid and frequent changes in network topology, it is not easy to apply the existing security measures to FANET without modification. Thus, this paper proposes lightweight security measures applicable to FANET, which have distinct characteristics from existing ad hoc networks by utilizing PUF technology. The proposed security measures utilize unique values generated by non-replicable PUFs to increase the safety of AODV, FANET's reactive routing protocol, and are resistant to various attacks.

A Study on Digital Image Watermarking for Embedding Audio Logo (음성로고 삽입을 위한 디지털 영상 워터마킹에 관한 연구)

  • Cho, Gang-Seok;Koh, Sung-Shik
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.3
    • /
    • pp.21-27
    • /
    • 2002
  • The digital watermarking methods have been proposed as a solution for solving the illegal copying and proof of ownership problems in the context of multimedia data. But it is still difficult to have been overcame the problem of the protection of property to multimedia data, such as digital images, digital video, and digital audio. This paper describes a watermarking algorithm that embeds non-linearly audio logo watermark data which is converted from audio signal of the ownership in the components of pixel intensities in an original image and that insists of ownership by hearing the audio signal transformed from the extracted audio logo through the speaker. Experimental results show that our algorithm using audio logo proposed in this paper is robust against attacks such as particularly lossy JPEG image compression. 

A Polyline Watermarking Scheme for GIS Vector Map (GIS 벡터맵 폴리라인 워터마킹 방법)

  • Kim, Jun-Hee;Lee, Suk-Hwan;Kwon, Seong-Geun;Park, Seung-Seob;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.4
    • /
    • pp.582-593
    • /
    • 2010
  • Recently the commercial value of GIS(geographic information system) has been increased with growing application demands of spatial information in life space. Also, GIS has been expanded to the integrated information system that provides the ease access to map information by public users and also the combined service of GIS map data and various multimedia contents. But several security problems of GIS map data have brought up at GIS industries, such as the illegal copy and distribution of GIS map data. Furthermore, the copyright protection of GIS map data has not been researched yet compared with image and video contents. This paper presents a polyline based watermarking scheme for the copyright protection of GIS vector map. The proposed scheme analyzes the structure of vector map and embeds adaptively the watermark by using the distance distribution of polyline components. From experimental results, we verified that the proposed scheme satisfies the invisibility and the robustness of geometrical attacks.

Zero-Watermarking based on Chaotic Side Match Vector Quantization (무질저한 SMVQ 기반의 제로-워터마킹)

  • Kim, Hyung-Do;Park, Chan-Kwon
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.7
    • /
    • pp.37-44
    • /
    • 2009
  • Digital watermarking is a technology for preventing illegal copying, for protecting intellectual property rights and copyrights, and for suggesting grounds of the ownership by inserting watermarks into digital contents. Generally speaking, watermarking techniques cannot escape from data distortion and quality degradation due to the watermark insertion. In order to overcome the shortcoming, zero-watermarking techniques which do not change the original data have been proposed recently. This paper proposes CSMVQ(Chaotic SMVQ), a zero-watermarking system for SMVQ(Side Match Vector Quantization) which shows better compression ratio and quality and less blocking effect than VQ(Vector Quantization). In SMVQ, compression progresses from left top to right bottom in order to use the information of the two neighbor blocks, so it is impossible to insert watermarks chaotically. In the process of encoding, CSMVQ dynamically considers the information of the (1 to 4) neighbor blocks already encoded. Therefore, watermark can be inserted into digital contents in chaotic way. Experimental results show that the image quality compressed by CSMVQ is better than that of SMVQ and the inserted watermark is robust against some common attacks.

Color Image Zero-Watermarking on DCT Domain through Comparison of Two Channels (두 채널 비교를 통한 DCT 영역 컬러 이미지 제로-워터마킹)

  • Kim, HyoungDo
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.9
    • /
    • pp.11-20
    • /
    • 2015
  • Digital watermarking provides electronic means for proving the copyrights of distributed digital media copies. Research on digital watermarking for images is recently directed toward that for color images extensively used in real life, based on the substantial results in digital watermarking for gray-scale images. Color images have multiple channels, each of which corresponds to a gray-scale image. While there are some watermarking techniques for color images that just apply those for gray-scale images to one channel of the color images, the correlation characteristics between the channels are not considered in them. This paper proposes a zero-watermarking technique that makes keys via combining an image dependent watermark, created through comparing two channels of the color image and copyright watermark scrambled. Due to zero-watermarking, it does not change anything of cover(host) images. Watermark images are robust against some common attacks such as sharpening, blurring, JPEG lossy compression, scaling, and cropping.