• 제목/요약/키워드: Image hiding

검색결과 223건 처리시간 0.05초

Enhancing Robustness of Information Hiding Through Low-Density Parity-Check Codes

  • Yi, Yu;Lee, Moon-Ho;Kim, Ji-Hyun;Hwang, Gi-Yean
    • Journal of Broadcast Engineering
    • /
    • 제8권4호
    • /
    • pp.437-451
    • /
    • 2003
  • With the rapid growth of internet technologies and wide availability of multimedia computing facilities, the enforcement of multimedia copyright protection becomes an important issue. Digital watermarking is viewed as an effective way to deter content users from illegal distributions. In recent years, digital watermarking has been intensively studied to achieve this goal. However, when the watermarked media is transmitted over the channels modeled as the additive white Gaussian noise (AWGN) channel, the watermark information is often interfered by the channel noise and produces a large number of errors. So many error-correcting codes have been applied in the digital watermarking system to protect the embedded message from the disturbance of the noise, such as BCH codes, Reef-Solomon (RS) codes and Turbo codes. Recently, low-density parity-check (LDPC) codes were demonstrated as good error correcting codes achieving near Shannon limit performance and outperforming turbo codes nth low decoding complexity. In this paper, in order to mitigate the channel conditions and improve the quality of watermark, we proposed the application of LDPC codes on implementing a fairly robust digital image watermarking system. The implemented watermarking system operates in the spectrum domain where a subset of the discrete wavelet transform (DWT) coefficients is modified by the watermark without using original image during watermark extraction. The quality of watermark is evaluated by taking Into account the trade-off between the chip-rate and the rate of LDPC codes. Many simulation results are presented in this paper, these results indicate that the quality of the watermark is improved greatly and the proposed system based on LDPC codes is very robust to attacks.

Hiding Shellcode in the 24Bit BMP Image (24Bit BMP 이미지를 이용한 쉘코드 은닉 기법)

  • Kum, Young-Jun;Choi, Hwa-Jae;Kim, Huy-Kang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • 제22권3호
    • /
    • pp.691-705
    • /
    • 2012
  • Buffer overflow vulnerability is the most representative one that an attack method and its countermeasure is frequently developed and changed. This vulnerability is still one of the most critical threat since it was firstly introduced in middle of 1990s. Shellcode is a machine code which can be used in buffer overflow attack. Attackers make the shellcode for their own purposes and insert it into target host's memory space, then manipulate EIP(Extended Instruction Pointer) to intercept control flow of the target host system. Therefore, a lot of research to defend have been studied, and attackers also have done many research to bypass security measures designed for the shellcode defense. In this paper, we investigate shellcode defense and attack techniques briefly and we propose our new methodology which can hide shellcode in the 24bit BMP image. With this proposed technique, we can easily hide any shellcode executable and we can bypass the current detection and prevention techniques.

A Encryption Technique of JPEG2000 Image Using 3-Dimensional Chaotic Cat Map (3차원 카오스 캣맵을 이용한 JPEG2000 영상의 암호화 기술)

  • Choi, Hyun-Jun;Kim, Soo-Min;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • 제42권5호
    • /
    • pp.173-180
    • /
    • 2005
  • In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform(DWT) and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system and cat map which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the Proposed methods implemented in software for about 500 images. Consequently, we are sure that the proposed is efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas.

Location Information Hiding Way Of HD Black Box Recording process (HD 블랙박스 녹화과정에서의 위치정보 은익방법)

  • Seok, Jin-Hwan;Yoon, Jong-Chul;Hong, Jong-Sung;Han, Chan-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • 제17권1호
    • /
    • pp.10-17
    • /
    • 2016
  • GPS location information storage included in the HD black box is using a unique manner for each manufacturer does not have a specific standard. In this paper, in order to overcome the limitations of the storage space and thereby the image quality according to store GPS position information deteriorate to solve the problems that cause, we propose the location information concealment method included in the HDTV video content using a essential hidden region. HDTV video content is a Border Extender of 8 lines in the frame to the bottom of the compression will be required. This was inserted into the image of a gray scale used in block form in order to space the current position information is concealed to prevent image degradation. The proposed method was confirmed using real HD black box, there are more difficult to interpret the format of the ASCII code re-edit the location information when the compression effect disappears with the existing security zones added. Therefore, the proposed method is suitable for location-based services, such as Facebook or Youtube videos.

A Video Watermarking Method using Global Masking (전역 마스킹을 이용한 비디오 워터마킹 방법)

  • 문지영;호요성
    • Journal of Broadcast Engineering
    • /
    • 제8권3호
    • /
    • pp.268-277
    • /
    • 2003
  • In this paper, we propose a new video watermarking method exploiting the human visual system (HVS) to find effective locations. in the video frames which make the watermark robust and imperceptible simultaneously. In particular, we propose a new HVS-optimized weighting map for hiding the watermark by considering HVS in three different aspects : frequency, spatial, and motion masking effects. The global masking map is modeled by combining the frequency masking, the spatial masking, and the motion masking. In this paper, we use a watermark which is generated by the bitwise exclusive-OR operation between a logo image and a random sequence. The amount of watermarks is weighted by a control parameter. Furthermore, we embed the watermark in the uncompressed video sequence for the general watermarking method available to various coding schemes. Simulation results show that the watermark is imperceptible and the proposed method is good for watermark capacity. It is also demonstrated that the proposed method is robust against various attacks, such as MPEG coding, MPEG re-encoding, and frame attacks.

Error Detection and Concealment of Transmission Error Using Watermark (워터마크를 이용한 전송 채널 에러의 검출 및 은닉)

  • 박운기;전병우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제29권2C호
    • /
    • pp.262-271
    • /
    • 2004
  • There are channel errors when video data are transmitted between encoder and decoder. These channel errors would make decoded image incorrect, so it is very important to detect and recover channel errors. This paper proposes a method of error detection and recovery by hiding specific information into video bitstream using fragile watermark and checking it later. The proposed method requires no additional bits into compressed bitstream since it embeds a user-specific data pattern in the least significant bits of LEVELs in VLC codewords. The decoder can extract the information to check whether the received bitstream has an error or not. We also propose to use this method to embed essential data such as motion vectors that can be used for error recovery. The proposed method can detect corrupted MBs that usually escape the conventional syntax-based error detection scheme. This proposed method is quite simple and of low complexity. So the method can be applied to multimedia communication system in low bitrate wireless channel.

A Study on Effective Digital Watermark Generation Method to Overcome Capacity Limit (저장 한계를 극복한 효율적인 디지털 워터마크 생성 방법 연구)

  • Kim Hee-Sun;Cho Dae-Jea
    • The Journal of the Korea Contents Association
    • /
    • 제5권6호
    • /
    • pp.343-350
    • /
    • 2005
  • During the design of a successful digital watermarking systems, Pseudo-Noise(PN) sequences are widely used to modulate information bits into watermark signals. In this method, the number of bits that can be hidden within a small image by means of frequency domain watermarking is limited. In this paper, we show the possibility of introducing chaotic sequences into digital watermarking systems as potential substitutes to commonly used PN-sequences. And we propose a method that transforms the text to chaotic sequence. In our current implementation, we show how the sample text is expressed by an implied unit data(watermark) and the implied unit data is regenerated into the original left. Because we use this implied data as watermark for information hiding, we can insert much more watermark compared with previous method.

  • PDF

Lossless Data Hiding Using Modification of Histogram in Wavelet Domain (웨이블릿 영역에서 히스토그램 수정을 이용한 무손실 정보은닉)

  • Jeong Cheol-Ho;Eom Il-Kyu;Kim Yoo-Shin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • 제43권4호
    • /
    • pp.27-36
    • /
    • 2006
  • Lossless data embedding is a method to insert information into a host image that guarantees complete restoration when the extraction has been done. In this paper, we propose a noble reversible data embedding algorithm for images in wavelet domain. The proposed embedding technique, which modifies histogram of wavelet coefficient, is composed of two inserting steps. Data is embedded to wavelet coefficient using modification of histogram in first embedding process. Second embedding step compensates the distortion caused by the first embedding process as well as hides more information. Hence we achieve higher inserting capacity. In view of the relationship between the embedding capacity and the PSNR value, our proposed method shows considerably higher performance than the current reversible data embedding methods.

Steganography Software Analysis -Focusing on Performance Comparison (스테가노그래피 소프트웨어 분석 연구 - 성능 비교 중심으로)

  • Lee, Hyo-joo;Park, Yongsuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제25권10호
    • /
    • pp.1359-1368
    • /
    • 2021
  • Steganography is a science of embedding secret data into innocent data and its goal is to conceal the existence of a carrier data. Many research on Steganography has been proposed by various hiding and detection techniques that are based on different algorithms. On the other hand, very few studies have been conducted to analyze the performance of each Steganography software. This paper describes five different Steganography software, each having its own algorithms, and analyzes the difference of each inherent feature. Image quality metrics of Peak Signal to Noise Ratio (PSNR) and Structural SIMilarity (SSIM) are used to define its performance of each Steganography software. We extracted PSNR and SSIM results of a quantitative amount of embedded output images for those five Steganography software. The results will show the optimal steganography software based on the evaluation metrics and ultimately contribute to forensics.

An Attack Origin Detection Mechanism in IP Traceback Using Marking Algorithm (마킹 알고리듬 기반 IP 역추적에서의 공격 근원지 발견 기법)

  • 김병룡;김수덕;김유성;김기창
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • 제13권1호
    • /
    • pp.19-26
    • /
    • 2003
  • Recently, the number of internet service companies is increasing and so is the number of malicious attackers. Damage such as distrust about credit and instability of the service by these attacks may influence us fatally as it makes companies image failing down. One of the frequent and fatal attacks is DoS(Denial-of-Service). Because the attacker performs IP spoofing for hiding his location in DoS attack it is hard to get an exact location of the attacker from source IP address only. and even if the system recovers from the attack successfully, if attack origin has not been identified, we have to consider the possibility that there may be another attack again in near future by the same attacker. This study suggests to find the attack origin through MAC address marking of the attack origin. It is based on an IP trace algorithm, called Marking Algorithm. It modifies the Martins Algorithm so that we can convey the MAC address of the intervening routers, and as a result it can trace the exact IP address of the original attacker. To improve the detection time, our algorithm also contains a technique to improve the packet arrival rate. By adjusting marking probability according to the distance from the packet origin we were able to decrease the number of needed packets to traceback the IP address.