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

검색결과 91건 처리시간 0.028초

Audio Data Hiding Based on Sample Value Modification Using Modulus Function

  • Al-Hooti, Mohammed Hatem Ali;Djanali, Supeno;Ahmad, Tohari
    • Journal of Information Processing Systems
    • /
    • 제12권3호
    • /
    • pp.525-537
    • /
    • 2016
  • Data hiding is a wide field that is helpful to secure network communications. It is common that many data hiding researchers consider improving and increasing many aspects such as capacity, stego file quality, or robustness. In this paper, we use an audio file as a cover and propose a reversible steganographic method that is modifying the sample values using modulus function in order to make the reminder of that particular value to be same as the secret bit that is needed to be embedded. In addition, we use a location map that locates these modified sample values. This is because in reversible data hiding it needs to exactly recover both the secret message and the original audio file from that stego file. The experimental results show that, this method (measured by correlation algorithm) is able to retrieve exactly the same secret message and audio file. Moreover, it has made a significant improvement in terms of the following: the capacity since each sample value is carrying a secret bit. The quality measured by peak signal-to-noise ratio (PSNR), signal-to-noise ratio (SNR), Pearson correlation coefficient (PCC), and Similarity Index Modulation (SIM). All of them have proven that the quality of the stego audio is relatively high.

A Data Hiding Scheme Based on Turtle-shell for AMBTC Compressed Images

  • Lee, Chin-Feng;Chang, Chin-Chen;Li, Guan-Long
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권6호
    • /
    • pp.2554-2575
    • /
    • 2020
  • Data hiding technology hides secret information into the carrier, so that when the carrier is transmitted over network, it will not attract any malicious attention. Using data compression, it is possible to reduce the data size into a small compressed code, which can effectively reduce the time when transmitting compressed code on the network. In this paper, the main objective is to effectively combine these two technologies. We designed a data hiding scheme based on two techniques which are turtle-shell information hiding scheme and absolute moment block truncation coding. The experimental results showed that the proposed scheme provided higher embedding capacity and better image quality than other hiding schemes which were based on absolute moment block truncation coding.

A Data Hiding Scheme for Grayscale Images Using a Square Function

  • Kwon, Hyejin;Kim, Haemun;Kim, Soonja
    • 한국멀티미디어학회논문지
    • /
    • 제17권4호
    • /
    • pp.466-477
    • /
    • 2014
  • Many image hiding schemes based on least significant bit (LSB) transformation have been proposed. One of the LSB-based image hiding schemes that employs diamond encoding was proposed in 2008. In this scheme, the binary secret data is converted into base n representation, and the converted secret data is concealed in the cover image. Here, we show that this scheme has two vulnerabilities: noticeable spots in the stego-image, i.e., a non-smooth embedding result, and inefficiency caused by rough re-adjustment of falling-off-boundary value and impractical base translation. Moreover, we propose a new scheme that is efficient and produces a smooth and high quality embedding result by restricting n to power of 2 and using a sophisticated re-adjustment procedure. Our experimental results show that our scheme yields high quality stego-images and is secure against RS detection attack.

Changing Partners Technique in Reversible Steganography

  • 우재현;조원진
    • 정보통신설비학회논문지
    • /
    • 제6권3호
    • /
    • pp.25-34
    • /
    • 2007
  • Steganography is hiding messages in cover materials like image, audio, etc. The previous studies are limited in the shifting problem of the histogram and capacity. This paper proposes a new technology which overcomes these two problems. Our new technology uses two colors as a pair and chooses either changing to its partner or remaining as they are according as each hiding bit. As a result, we show that the result of this technology shows that the hiding capacity is higher than other methods.

  • PDF

Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting

  • Hwang, Hee-Joon;Kim, Hyoung-Joong;Sachnev, Vasiliy;Joo, Sang-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권4호
    • /
    • pp.655-670
    • /
    • 2010
  • To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embedding capacity and low distortion. Using predicted errors is very effective for increasing the embedding capacity. Sorting the predicted errors has a good influence on decreasing distortion. In this paper, we present an improved reversible data hiding scheme using upgraded histogram shifting based on sorting the predicted errors. This new scheme is characterized by the algorithm which is able to find the optimum threshold values and manage the location map effectively. Experimental results compared with other methods are presented to demonstrate the superiority of the proposed method.

다중 픽셀 차이값과 LSB 교체 기법을 이용한 이미지 스테가노그래픽 기법 연구 (A Study on the Image Steganographic method using Multi-pixel Differencing and LSB Substitution Methods)

  • 하경주;정기현;유기영
    • 한국산업정보학회논문지
    • /
    • 제13권3호
    • /
    • pp.23-30
    • /
    • 2008
  • A data hiding method based on least significant bit (LSB) substitution and multi-pixel differencing (MPD) is presented on the proposed method to improve the capacity of the hidden secret data and to provide an imperceptible visual quality. First, a sum of different values for four-pixel sub-block is calculated. The low value of the sum can be located on a smooth block and the high value is located on an edged block. The secret data are hidden into the cover image by LSB method in the smooth block, while MPD method in the edged block. The experimental results show that the proposed method has a higher capacity and maintains a good visual quality.

  • PDF

New Text Steganography Technique Based on Part-of-Speech Tagging and Format-Preserving Encryption

  • Mohammed Abdul Majeed;Rossilawati Sulaiman;Zarina Shukur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권1호
    • /
    • pp.170-191
    • /
    • 2024
  • The transmission of confidential data using cover media is called steganography. The three requirements of any effective steganography system are high embedding capacity, security, and imperceptibility. The text file's structure, which makes syntax and grammar more visually obvious than in other media, contributes to its poor imperceptibility. Text steganography is regarded as the most challenging carrier to hide secret data because of its insufficient redundant data compared to other digital objects. Unicode characters, especially non-printing or invisible, are employed for hiding data by mapping a specific amount of secret data bits in each character and inserting the character into cover text spaces. These characters are known with limited spaces to embed secret data. Current studies that used Unicode characters in text steganography focused on increasing the data hiding capacity with insufficient redundant data in a text file. A sequential embedding pattern is often selected and included in all available positions in the cover text. This embedding pattern negatively affects the text steganography system's imperceptibility and security. Thus, this study attempts to solve these limitations using the Part-of-speech (POS) tagging technique combined with the randomization concept in data hiding. Combining these two techniques allows inserting the Unicode characters in randomized patterns with specific positions in the cover text to increase data hiding capacity with minimum effects on imperceptibility and security. Format-preserving encryption (FPE) is also used to encrypt a secret message without changing its size before the embedding processes. By comparing the proposed technique to already existing ones, the results demonstrate that it fulfils the cover file's capacity, imperceptibility, and security requirements.

모듈러 연산과 히스토그램 이동에 기반한 새로운 가역 정보 은닉 기법 (A novel Reversible Data Hiding Scheme based on Modulo Operation and Histogram Shifting)

  • 김대수;유기영
    • 한국멀티미디어학회논문지
    • /
    • 제15권5호
    • /
    • pp.639-650
    • /
    • 2012
  • Tsai 등은 2009년에 예측 코딩과 히스토그램 이동 기법을 이용한 가역 은닉 방법을 제안하였다. Tsai 등의 방법은 비밀 정보를 숨길 수 있는 양을 향상시키기 위해 예측 코딩을 이용하고, 히스토그램을 두 개 생성하였다. 하지만, 예측 코딩은 삽입과정에서 기준 픽셀이 사용되지 않고, 히스토그램을 두 개로 나누는 방법은 한 블록마다 두 쌍의 최대값과 최소값이 생성되기 때문에 기존 히스토그램 이동 기법보다 많은 양의 추가 전송 데이터가 발생하게 된다. 이러한 문제점을 해결하기 위해 본 논문에서는 모듈러 연산과 히스토그램 이동에 기반한 새로운 가역 정보 은닉 기법을 제안한다. 실험결과를 통해 제안한 방법의 비밀 정보를 숨길 수 있는 양은 Tsai 등의 방법보다 28% 증가 하면서도 추가 전송 데이터의 양은 71% 감소하는 것을 볼 수 있었다.

차분 영상 히스토그램 수정 기반의 가역 데이터 은닉 기법 (Reversible Data Hiding Based on the Histogram Modification of Difference Image)

  • 유향미;이상광;서재원
    • 대한전자공학회논문지SP
    • /
    • 제48권2호
    • /
    • pp.32-40
    • /
    • 2011
  • 가역 데이터 은닉 기법은 영상에 데이터를 삽입 후, 영상에서 삽입된 데이터를 추출한 후에 원본 영상의 복원이 완벽하게 가능한 기법을 말하며 최근에 많은 관심을 받고 있는 분야이다. 이러한 복원 가능한 데이터 은닉 기법 중 기존의 히스토그램을 이용한 기법들은 히스토그램 수정 때문에 언더플로우와 오버플로우를 발생시킴으로써 데이터가 숨겨진 영상의 화질이 떨어지게 된다. 본 논문에서는 이러한 문제점을 해결하기위해 언더플로우와 오버플로우가 발생하는 위치를 표시하는 로케이션 맵정보를 영상에 추가로 삽입하여 해결하는 새로운 가역 데이터 은닉 기법을 제안한다. 또한 삽입되는 데이터의 양을 증가시키기 위해서 멀티 레벨 데이터 은닉 기법을 알고리즘에 적용하였다. 실험결과 제안하는 알고리즘은 PSNR, 데이터 삽입량, 추가적인 데이터의 크기 면에서 우수한 성능을 보였다.

Enhanced Reversible data hiding scheme

  • Sachnev, V.;Kim, Dong-Hoi;Kim, Hyoung-Joong
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2007년도 동계학술대회
    • /
    • pp.127-133
    • /
    • 2007
  • We propose new reversible watermarking method for images. Being reversibility, original image and watermarked message should be recovered exactly. We propose different technique for hiding data to pairs. We use new type of histogram (pair histogram), which shows frequencies of each pair in image. We use histogram shift method for data embedding to pairs. We also propose improved version of method which allow hiding data with good performance for high capacities. This algorithm has better result compare to Tian's difference expansion method based on the Haar wavelet decomposition. For proposed algorithm capacity is higher under same PSNR.

  • PDF