An Efficient Data-Hiding Scheme Based on Multidimensional Mini-SuDoKu

Ji-Hwei Horng, Shuying Xu, Ching-Chun Chang, Chinchen Chang

TL;DR

This paper introduces a novel multidimensional data-hiding scheme that leverages a "cubic mini-SuDoKu matrix" (CMSM) to embed secret data within images. By extending the mini-SuDoKu concept into three dimensions and introducing a range locator function, the scheme achieves high embedding capacity and excellent image quality, outperforming existing methods in both aspects.

What Problem Does This Paper Address?

The paper tackles the critical challenge of information security in the context of the Internet of Things (IoT). As more data is transmitted over open channels, protecting sensitive information from malicious interception is paramount. While encryption is one approach, it can attract attackers. Data hiding (steganography) offers a more covert solution by concealing the very existence of secret data within cover media like images. Existing data-hiding methods, particularly those based on spatial domain techniques and reference matrices (RM), face trade-offs between embedding capacity, image quality, and security. This paper aims to improve these metrics by proposing a more complex and efficient multidimensional RM.

Methods

The core of the proposed method is the Cubic Mini-SuDoKu Matrix (CMSM). This is a 3D reference matrix (256x256x256) built upon the concept of mini-SuDoKu, where each 4x4x4 sub-cube contains 2x2x2 basic structures filled with numbers 0-7.

The data embedding process is a two-layered approach:

  1. Outer Layer (Basic Structure Location): The 3 most significant bits (MSBs) of a 6-bit secret segment are used to locate a specific basic structure within the CMSM. This is achieved using a novel range locator function (G), which efficiently determines the search range for each axis, minimizing the need for exhaustive searching.
  2. Inner Layer (Element Matching): The remaining 3 least significant bits (LSBs) of the secret segment are used to find a matching element within the identified basic structure. The cover image pixels are then modified to match the coordinates of this element, effectively embedding the secret data.

The scheme is further generalized to an N-Dimensional Mini-SuDoKu Matrix (NMSM), allowing for n-tuple pixel groups to embed n MSBs and n LSBs, thus increasing embedding capacity and security with higher dimensions. A fast algorithm leveraging matrix operations is also proposed for the inner embedding layer to improve efficiency.

Datasets

The paper uses standard grayscale images (Lena, peppers, airplane, baboon, boat, Elaine, Gledhill, sailboat) and true color images (baboon, Lena, peppers, Tiffany) for evaluation. All images are 512x512 pixels. No new datasets were introduced.

Key Insights and Ideas

  • Multidimensionality for Security and Capacity: Extending the mini-SuDoKu concept to 3D (and N-D) significantly increases the complexity of the reference matrix, thereby enhancing security. It also directly translates to higher embedding capacity by allowing more secret bits to be encoded per pixel group.
  • Range Locator Function: This function is a crucial innovation. It efficiently narrows down the search space for the correct basic structure, avoiding computationally expensive brute-force methods and improving embedding speed.
  • Two-Layered Embedding: The separation of MSBs for structure location and LSBs for element matching provides a structured and efficient way to embed data while maintaining control over pixel modifications.
  • Generalizability to N-Dimensions: The ability to extend the scheme to N-dimensions makes it adaptable to various data structures and future IoT applications, offering a flexible and scalable solution.

Key Results

  • High Image Quality: The proposed scheme consistently achieves a high Peak Signal-to-Noise Ratio (PSNR) of approximately 46.37 dB for grayscale images and similar values for color images, indicating minimal distortion and excellent visual quality of the stego images.
  • High Embedding Capacity: The scheme achieves an embedding capacity of 2 bits per pixel for grayscale images (524,288 bits for a 512x512 image) and 6 bits per pixel for color images (1,572,864 bits for a 512x512 image).
  • Outperforms Existing Methods: Compared to several state-of-the-art data-hiding schemes, the proposed method demonstrates superior PSNR values while maintaining competitive or higher embedding capacities. For instance, it achieves a PSNR nearly 4 dB higher than Xie et al.'s scheme and significantly higher than Xia et al.'s 3D SuDoKu-based scheme.
  • Improved Time Efficiency: The proposed algorithm is significantly faster than traditional approaches, with embedding times less than half of the compared methods, especially as the dimensionality increases.

Limitations and Future Work

  • Computational Load for High Dimensions: While the NMSM is generalized, the construction of very high-dimensional matrices could still lead to significant computational load, although the paper suggests techniques to mitigate this.
  • Key Management: As with any cryptographic or steganographic scheme, secure management of the secret key for reconstructing the CMSM/NMSM is crucial and not detailed in this paper.
  • Future Work: The authors suggest that the flexibility in dimension of RM meets the diverse data structure of cover media in the future word of massive IoT, implying potential applications in more complex data types beyond standard images. Further exploration of its application in multimedia communication within IoT environments is also implied.

Summary updated

Abstract

The massive Internet of Things (IoT) connecting various types of intelligent sensors for goods tracking in logistics, environmental monitoring and smart grid management is a crucial future ICT. High-end security and low power consumption are major requirements in scaling up the IoT. In this research, we propose an efficient data-hiding scheme to deal with the security problems and power saving issues of multimedia communication among IoT devises. Data hiding is the practice of hiding secret data into cover images in order to conceal and prevent secret data from being intercepted by malicious attackers. One of the established research streams of data-hiding methods is based on reference matrices (RM). In this study, we propose an efficient data-hiding scheme based on multidimensional mini-SuDoKu RM. The proposed RM possesses high complexity and can effectively improve the security of data hiding. In addition, this study also defines a range locator function which can significantly improve the embedding efficiency of multidimensional RM. Experimental results show that our data-hiding scheme can not only obtain better image quality, but also achieve higher embedding capacity than other related schemes.
BibTeX
@inproceedings{horng2020efficient,
  author = {Ji-Hwei Horng and Shuying Xu and Ching-Chun Chang and Chinchen Chang},
  title = {{An Efficient Data-Hiding Scheme Based on Multidimensional Mini-SuDoKu}},
  booktitle = {Sensors},
  year = {2020},
  url = {https://openreview.net/forum?id=P2Mq7zIrOI},
}

Loading related content...

Figure