• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.4153-4169
• /
• 2014

To recognize F5-like (such as F5 and nsF5) steganographic algorithm from multi-class stego images, a recognition algorithm based on the identifiable statistical feature (IDSF) of F5-like steganography is proposed in this paper. First, this paper analyzes the special modification ways of F5-like steganography to image data, as well as the special changes of statistical properties of image data caused by the modifications. And then, by constructing appropriate feature extraction sources, the IDSF of F5-like steganography distinguished from others is extracted. Lastly, based on the extracted IDSFs and combined with the training of SVM (Support Vector Machine) classifier, a recognition algorithm is presented to recognize F5-like stego images from images set consisting of a large number of multi-class stego images. A series of experimental results based on the detection of five types of typical JPEG steganography (namely F5, nsF5, JSteg, Steghide and Outguess) indicate that, the proposed algorithm can distinguish F5-like stego images reliably from multi-class stego images generated by the steganography mentioned above. Furthermore, even if the types of some detected stego images are unknown, the proposed algorithm can still recognize F5-like stego images correctly with high accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3421-3443
• /
• 2021

A data hiding method based on integer factorization via e-books in the EPUB format with XHTML and CSS files for copyright protection is proposed. Firstly, a fixed number m of leading bits in a message are transformed into an integer which is then factorized to yield k results. One of the k factorizations is chosen according to the decimal value of a number n of the subsequent message bits with n being decided as the binary logarithm of k. Next, the chosen factorization, denoted as a × b, is utilized to create a combined use of the

and elements in the XHTML files to embed the m + n message bits by including into the two elements a class selector named according to the value of a as well as a text segment with b characters. The class selector is created by the use of a CSS pseudo-element. The resulting web pages are of no visual difference from the original, achieving a steganographic effect. The security of the embedded message is also considered by randomizing the message bits before they are embedded. Good experimental results and comparisons with exiting methods show the feasibility of the proposed method for copyright protection of e-books.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4788-4813
• /
• 2019

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field $GF(p^m)$ using graph and automata to design the data hiding scheme of the general form ($k,N,{\lfloor}{\log}_2p^{mn}{\rfloor}$) for binary, gray and palette images with the given assumptions, where k, m, n, N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권11호
• /
• pp.4184-4202
• /
• 2021

Text steganography combined with natural language generation has become increasingly popular. The existing methods usually embed secret information in the generated word by controlling the sampling in the process of text generation. A candidate pool will be constructed by greedy strategy, and only the words with high probability will be encoded, which damages the statistical law of the texts and seriously affects the security of steganography. In order to reduce the influence of the candidate pool on the statistical imperceptibility of steganography, we propose a steganography method based on a new sampling strategy. Instead of just consisting of words with high probability, we select words with relatively small difference from the actual sample of the language model to build a candidate pool, thus keeping consistency with the probability distribution of the language model. What's more, we encode the candidate words according to their probability similarity with the target word, which can further maintain the probability distribution. Experimental results show that the proposed method can outperform the state-of-the-art steganographic methods in terms of security performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권6호
• /
• pp.1619-1637
• /
• 2024

In today's highly digitized landscape, securing digital communication is paramount due to threats like hacking, unauthorized data access, and network policy violations. The response to these challenges has been the development of cryptography applications, though many existing techniques face issues of complexity, efficiency, and limitations. Notably, sophisticated intruders can easily discern encrypted data during transmission, casting doubt on overall security. In contrast to encryption, steganography offers the unique advantage of concealing data without easy detection, although it, too, grapples with challenges. The primary hurdles in image steganography revolve around the quality and payload capacity of the cover image, which are persistently compromised. This article introduces a pioneering approach that integrates image steganography and encryption, presenting the BitPatternStego method. This novel technique addresses prevalent issues in image steganography, such as stego-image quality and payload, by concealing secret data within image pixels with identical bit patterns as their characters. Consequently, concerns regarding the quality and payload capacity of steganographic images become obsolete. Moreover, the BitPatternStego method boasts the capability to generate millions of keys for the same secret message, offering a robust and versatile solution to the evolving landscape of digital security challenges.

• 한국멀티미디어학회논문지
• /
• 제9권2호
• /
• pp.215-225
• /
• 2006

흑백 두 가지의 값으로만 구성된 이진영상(만화 영상, 문서 영상 및 서명 영상 등)은 컬러 영상에 비해 적은 양의 잉여부분으로 인해 비가시적인 비밀 데이터의 삽입이 어렵다. 따라서 이진 엄폐영상을 이용한 심층암호에서는 많은 양의 비밀 데이터를 삽입하면서, 동시에 은닉영상의 비가시성을 만족시킬 수 있는 기술이 요구된다. 본 논문에서는 이에 대한 기존 연구들의 장점을 보완하여 은닉영상의 열화를 최소화 하고, 동시에 충분한 용량의 비밀 데이터를 삽입할 수 있는 방식을 제안한다. 제안 방식은 비가시적인 위치의 화소만을 변경시키며, $m{\times}n$ 크기의 한 블록에 대해서 [$log_2(mn+1)-2$] 비트의 비밀 데이터를 숨길 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1938-1962
• /
• 2015

Security of information during transmission is a major issue in this modern era. All of the communicating bodies want confidentiality, integrity, and authenticity of their secret information. Researchers have presented various schemes to cope with these Internet security issues. In this context, both steganography and cryptography can be used effectively. However, major limitation in the existing steganographic methods is the low-quality output stego images, which consequently results in the lack of security. To cope with these issues, we present an efficient method for RGB images based on gray level modification (GLM) and multi-level encryption (MLE). The secret key and secret data is encrypted using MLE algorithm before mapping it to the grey-levels of the cover image. Then, a transposition function is applied on cover image prior to data hiding. The usage of transpose, secret key, MLE, and GLM adds four different levels of security to the proposed algorithm, making it very difficult for a malicious user to extract the original secret information. The proposed method is evaluated both quantitatively and qualitatively. The experimental results, compared with several state-of-the-art algorithms, show that the proposed algorithm not only enhances the quality of stego images but also provides multiple levels of security, which can significantly misguide image steganalysis and makes the attack on this algorithm more challenging.

• 전자공학회논문지
• /
• 제52권4호
• /
• pp.99-105
• /
• 2015

스마트폰 사용의 확대로 iOS와 Android 운영체제에 대한 관심이 높아지고 있다. 본 논문에서는 안드로이드 플랫폼을 기반으로 한 스테가노그래픽 기법으로 안드로이드에서 기본적으로 제공하는 그래픽 라이브러리인 스키아를 기반으로 한 영상 포맷을 분석하고, 분석된 포맷에 기반한 알고리즘을 제안한다. 제안하는 알고리즘은 Alpha, Red, Green, Blue 각각 8비트씩 총 32비트를 사용하는 트루 칼라를 기반으로 네 개의 각 8비트 영역을 활용하여 비밀자료를 숨긴다. 또한 이미지 왜곡이 덜 민감한 Alpha 영역을 활용하여 최대한 비밀자료를 숨길 수 있도록 알고리즘을 제안함으로써, 안드로이드를 기반으로 하는 스마트기기에 모두 사용이 가능할 것으로 보인다. 실험결과에서는 Alpha값의 변화에 따른 비밀자료 삽입용량과 이미지 왜곡 정도를 보임으로써 제안하는 알고리즘의 우수성을 증명하고 있다.

• 한국정보통신학회논문지
• /
• 제25권10호
• /
• pp.1359-1368
• /
• 2021

스테가노그래피는 데이터 안에 데이터를 은폐하는 기술로, 전달 매체의 존재가 발각되지 않도록 하는 것이 주요목적이다. 현재 스테가노그래피 관련 연구는 알고리즘을 기반으로 정립된 은닉 기법, 검출 기법들에 관련해서 다양하게 연구되고 있지만, 소프트웨어 성능을 분석하기 위한 실험 중심의 연구는 상대적으로 부족하다. 본 논문은 서로 다른 알고리즘으로 데이터를 은폐하는 다섯 개의 스테가노그래피 소프트웨어의 특징을 파악하고, 평가하는 데 목적을 두었다. 스테가노그래피 소프트웨어의 성능 조사를 위하여 시각 평가 척도로 사용되는 PSNR(Peak Signal to Noise Ratio), SSIM(Structural SIMilarity)을 이용하였다. 스테가노그래피 소프트웨어를 통하여 임베딩한 스테고 이 미지들의 PSNR, SSIM을 도출하여 정량적 성능 비교 분석한다. 평가 척도에 따라 우수한 스테가노그래피 소프트웨어를 소개하여 포렌식에 기여 하고자 한다.

• 정보보호학회논문지
• /
• 제13권3호
• /
• pp.1-15
• /
• 2003

Cachi $n^{[1]}$ 으로부터 시작된 심층 암호의 안전성에 대한 정의는 Katzenbeisse $r^{［2］}$가 심층 암호의 공격 모델을 기반으로 한 안전성을 논의함으로써 보다 구체화되었으며, 이 후 Hoppe $r^{［3］}$가 계산 이론적인 관점에서 일방향 함수가 존재한다면 안전한 심층 암호도 존재함을 증명하였다. 그러나 실제 구현함에 있어 지금까지의 심층 암호 알고리즘은 앞서 정의된 이론적인 안전성을 고려하지 않고, 데이터의 최하위 비트와 비밀 메시지를 치환해 왔다. 비록 데이터의 최하위 비트가 인간의 감각으로는 인지할 수 없으며 랜덤해 보이기까지 하지만 Westfel$d^{［4］}$ 등이 제안한 시각 및 통계 공격에 의하여 비밀 메시지의 삽입을 탐지해낼 수 있었다. 본 논문에서 우리는 블록 암호의 출력이 랜덤한 점을 이용하여 원본을 최소한으로 변형시키지만 충분한 양의 데이터를 삽입하는 방법을 제안하려고 한다. 실험 결과, 제안하는 알고리즘은 단순 최하위 비트 치환 심층 암호와 대등한 데이터 삽입량를 가지면서도 시각 및 통계 공격에 강인하였다.