FIGURE 3 - available via license: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Content may be subject to copyright.
Source publication
Quantum image steganography is one of the important research branches of quantum secure communications. In this paper, a large payload quantum image steganography protocol based on quantum image expansion and the Grover search algorithm is proposed. The new algorithm adopts quantum log-polar image (QUALPI) representation to prepare the quantum imag...
Context in source publication
Similar publications
In this paper present an enhanced design of the image Steganography in which take multiple images that are hiding one by one into the cover image using the LSB technique. Using the LSB technique, first hide the secrete image 1 into the secret image 2 and after that get setgo image 1 that is hide into the cover image using the LSB technique and get...
Digital Steganography means hiding sensitive data inside a cover object in a way that is invisible to un-authorized persons. Many proposed steganography techniques in spatial domain may achieve high invisibility requirement but sacrifice the good robustness against attacks. In some cases, we need to take in account not just the invisibility but als...
Steganography is a technique for publicly transmitting secret information through a cover. Most of the existing steganography algorithms are based on modifying the cover image, generating a stego image that is very similar to the cover image but has different pixel values, or establishing a mapping relationship between the stego image and the secre...
Online social networks have stimulated communications over the Internet more than ever, making it possible for secret message transmission over such noisy channels. In this paper, we propose a Coverless Image Steganography Network, called CIS-Net, that synthesizes a high-quality image directly conditioned on the secret message to transfer. CIS-Net...
Image steganography is a scheme that hides secret information in a cover image without being perceived. Most of the existing steganography methods are more concerned about the visual similarity between the stego image and the cover image, and they ignore the recovery accuracy of secret information. In this paper, the steganography method based on i...
Citations
... For instance, El-Latif et al. [24] introduced the concept of quantum walks in image steganography, effectively enhancing the algorithm's security. Qu et al. [25] significantly enhanced the embedding efficiency of the algorithm by employing quantum image extension and Grover's algorithm. Qu et al. [26] devised a controlled quantum image steganography protocol relying on quantum entanglement, enabling the sender to ensure accurate retrieval of the secret message by the recipient. ...
This paper introduces two novel quantum audio steganography methods that incorporate the logical properties of entangled qubits into the least significant qubit steganography (LSQb) approach. The first method, called entanglement-assisted probability adjustment LSB (EP-LSQb), optimizes the superposition probability of the lowest qubits before embedding the information. This addresses the ‘value-pairing’ problem and improves anti-statistical analysis performance and embedding efficiency. The second method, called quantum phase direct embedding LSB (PD-LSQb), extends traditional LSB steganography by directly embedding the secret speech into the least significant qubit. Quantum circuits are constructed for both methods to demonstrate their feasibility. Theoretical analysis and simulation experiments show that these methods exhibit good imperceptibility (PSNR>50\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text{PSNR}} > 50$$\end{document}) and embedding efficiency. Particularly, EP-LSQb method enhances the theoretical limit of embedding efficiency when compared to its corresponding classical counterparts. Additionally, due to the inclusion of entangled qubit particles, our methods offer competitive content security and noise robustness, distinguishing them from classical LSB or general LSQb methods and highlighting the unique advantages of quantum approaches.
... Also, the progressive upgradation of quantum computers paves the way for more QIMP algorithms. So far, the algorithms like quantum image feature extraction [8], filtering [9], segmentation [10], and security-based techniques such as quantum image encryption [11], watermarking [12], and stenography [13] have been developed. Further, the parts involved in QIMP are split up into three categories. ...
Quantum image processing is the budding branch in image processing for processing images in the quantum computer with the aid of quantum mechanics and linear algebra. Also, in recent decades, fuzzy has played a vital role in image processing as digital images are acquired with different uncertainties due to various factors. Hence, combining fuzzy and quantum in image processing techniques can bring effective results and has significant applications in different fields. In order to process the fuzzy image in a quantum computer, a new approach is derived to represent the fuzzy image as a quantum image. Thus, the quantum representation of fuzzy image derived in this paper enables storing and processing the fuzzy image using the basis states of qubits in the quantum circuit. Moreover, the experiment was made with a sample image to prepare a quantum image through the IBM quantum experience platform. Finally, through the measurement of the quantum circuit, the visual interface of quantum information for the proposed method is successfully established.
... Instead of directly replacing the LSB with a simple LSB, the protocol uses Grey coding to indirectly embed secret information into the LSB of pixels, which improves the security of the protocol. In 2019, Qu et al. [20], based on the QUALPI model, proposed a quantum image steganography protocol by using quantum image extension technology and the Grover search algorithm, which not only has good imperceptibility but also has a large capacity. Based on the NEQR, Luo et al. [21] proposed a blind quantum steganography protocol based on ASCII code in 2019. ...
... The formula is shown as Eq. (20). Table 3 shows the comparison of the BER values of the two protocols proposed in this paper and the protocol proposed by Hu et al. [26] under different salt-and-pepper noise densities. ...
In this paper, two efficient quantum image steganography protocols based on double-layer matrix coding are proposed. The first protocol is based on the high embedding efficiency of the classic Zhang Weiming, Zhang Xinpeng and Wang Shuozhong’s steganography framework and matrix coding, combined with quantum image carrier, so that the new protocol not only has very high embedding efficiency but also has high security. The second protocol further proposes a more efficient quantum image steganography protocol, which not only achieves a higher embedding efficiency than the first protocol but also doubles the capacity of the first protocol. To reflect the practicality of these two protocols, we also designed dedicated quantum circuits to embed and extract secret information. Based on the IBMQ quantum experiment platform, we successfully ran the core circuits of the protocol and gave the corresponding results. The simulation results based on MATLAB and the mathematical analysis also show that the two new protocols not only have good imperceptibility but also have high embedding efficiency.
... Quantum image processing algorithms (QIPA) based on different quantum image representation models emerge continually, such as quantum image segmentation [16], quantum image matching [17], quantum image watermarking (QImW) [18], quantum image steganography(QImS) [19]- [20], and quantum image encryption(QImE) [21]- [22]. In addition, image scrambling is also a method often used in image encryption. ...
Quantum image representation has a significant impact in quantum image processing. In this paper, a bit-plane representation for log-polar quantum images (BRLQI) is proposed, which utilizes $(n+4)$ or $(n+6)$ qubits to store and process a grayscale or RGB color image of $2^n$ pixels. Compared to a quantum log-polar image (QUALPI), the storage capacity of BRLQI improves 16 times. Moreover, several quantum operations based on BRLQI are proposed, including color information complement operation, bit-planes reversing operation, bit-planes translation operation and conditional exchange operations between bit-planes. Combining the above operations, we designed an image scrambling circuit suitable for the BRLQI model. Furthermore, comparison results of the scrambling circuits indicate that those operations based on BRLQI have a lower quantum cost than QUALPI. In addition, simulation experiments illustrate that the proposed scrambling algorithm is effective and efficient.
... Several existing quantum steganography models have been implemented using grayscale quantum images [24,25]. These include least significant bit (LSB) modification [26], image expansion [27], and exploiting modification direction [28]. Algorithms adopting colorized cover images have also been investigated [29][30][31]. ...
Encryption and information hiding are widely used in security applications requiring copyright protection, over-communication, and tamper detection. Quantum steganography, using quantum images and audio as information carriers, is a fascinating hybrid of classical and quantum informatics. While existing steganography techniques offer high invisibility, current embedding capacities remain insufficient. As such, a high capacity quantum steganography algorithm, based on image interpolation, is proposed in this study. In this approach, quantum interpolation is conducted by maximizing difference values between neighboring pixels to generate a cover image. Secret message embedding and extraction steps are then developed for the resulting quantum images, in addition to corresponding quantum circuit networks. A series of simulation experiments were conducted to demonstrate the implementation and assess the performance of the proposed technique, the efficiency of which was evaluated using several performance metrics and the visual quality of the stego-images. The resulting information capacity was much higher than that of existing quantum steganography algorithms. This suggests the proposed strategy to be a promising trade-off between invisibility and capacity, providing new motivation to investigate image steganography using quantum computing resources.
... e authors in [15] used the principle of pixel overlapping to hide a large amount of information with high image quality. In [16], a quantum information hiding protocol was suggested based on image expansion using the quantum log-polar image representation and the Grover search algorithm to extract the precisely designed secret message and determine the correct quantitative image copy. In [17], the genetic algorithm (GA) was used with a linear convergence generator to hide confidential data into the cover image by specifying the appropriate locations to include at least two bits in each pixel. ...
... pbest i ⟵ x i //Update local best position (11) end if (12) if f(pbest i ) > f(gbest) (13) gbest ⟵ pbest i //Update global best position (14) end if (15) end for (16) for i � 1 to N (17) Update v i using equation (6) (18) Update x i using equation (2) ...
Image steganography has been widely adopted to protect confidential data. Researchers have been seeking to improve the steganographic techniques in order to increase the embedding capacity while preserving the stego-image quality. In this paper, we propose a steganography method using particle swarm optimization and chaos theory aiming at finding the best pixel locations in the cover image to hide the secret data while maintaining the quality of the resultant stego-image. To enhance the embedding capacity, the host and secret images are divided into blocks and each block stores an appropriate amount of secret bits. Experimental results show that the proposed scheme outperforms existing methods in terms of the PSNR and SSIM image quality metrics.
... Finally, to try to understand the operation of quantum physics, there are also several applications of the Grover algorithm as a security measure when using encryption techniques and user detection protocols [53][54][55][56][57][58][59][60][61], and simulations that satisfy the resolution of complex problems such as the transcendental logarithm problem, [62], [57]. This paper has been organized in the following way: First of all, preliminary concepts are introduced and some concepts of the formalisms of quantum mechanics are illustrated which will allow introducing Grover's algorithm that will be covered in the second part. ...
Classical computing there are multiple algorithms to efficiently locate a certain element within a disorganized database; however, quantum computing can be applied more assertively in the face of problems in which it is complicated to verify a solution and at the same time to test multiple and possible solutions. Therefore, this article presents an introduction to Quantum Computing, developing some concepts of quantum formalism, and then approach Grover's algorithm which exploits the principle of superposition to the maximum. Finally, a classic simulation of this algorithm is performed, and the results obtained are compared with classical. Current position: Professor at Universidad Distrital Francisco José de Caldas, Colombia. algorithms such as sequential search and binary search method. A 95% is obtained as a result of greater effectiveness in times-when solving the same search-, revealing the potential advantages of quantum computing. Resumen: En la computación clásica existen múltiples algoritmos para localizar de manera eficiente un determinado elemento dentro de una base de datos desorganizada; sin embargo, la computación cuántica puede aplicarse de manera más asertiva frente a tales problemas cuando es complejo verificar una solución y a la vez probar múltiples y posibles soluciones. Por lo anterior, en este artículo se presenta una introducción a la Computación Cuántica-desarrollando algunos conceptos del formalismo cuántico-, y luego se aborda el algoritmo de Grover el cual explota al máximo el principio de superposición. Finalmente se realiza una simulación clásica de dicho algoritmo, y los resultados obtenidos se comparan con otros algoritmos clásicos como el método de búsqueda lineal y búsqueda binaria. Se obtiene como resultado un %95 de mayor efectividad en tiempos-a la hora de resolver la misma búsqueda-, logrando poner de manifiesto las ventajas potenciales de la computación cuántica.
... The basic idea of entity link is to select a group of candidate entity objects from the knowledge base according to the given entity reference items, and then link the reference items to the correct entity objects through similarity calculation. In recent years, academia has begun to pay attention to utilizing the co-occurrence relationship of entities, while linking multiple entities to the knowledge base, called collective entity linking [33]. ...
... The key technique to gain such an advantage is so-called quantum computing which is applicable to solve a series problems in such a wide range of quantum information processing. It can reduce the algorithm complexity in multimedia processing [3][4][5] and benefit the information security as well through protecting communication from eavesdropping [6][7][8]. Some papers focus on the states preparation for quantum communication [9,10]. ...
... Jiang and Wang [23] proposed a quantum image steganography protocol based on Moire pattern. Enhanced quantum representation (NEQR) and least significant bit (LSB) are widely used in QMS [20,[24][25][26][27][28][29]. ...
The quantum steganalysis faces more challenges than classical steganalysis owing to the support of quantum mechanical principles such as Heisenberg uncertainty principle and non-cloning theorem. In this paper, a novel quantum steganalysis protocol based on pure state is proposed, which adheres to the fundamental fact that classical steganography tends to change the probability distribution of the carrier, and the physical properties that the unknown quantum state discrimination process is sensitive to the distribution in quantum state discrimination. After utilizing accurate calculation on the geometric coherence and 1/2-affinity coherence to obtain the probability that the transmitted quantum states can be correctly discriminated, effective detection on covert communication can be achieved by comparing the detected distribution with theoretical distribution. Meanwhile, steganographic detection rate and false alarm rate are introduced as two significant performance evaluation parameters of quantum steganalysis. In this paper, the quantum steganalysis and performance evaluation targeting the BB84-based quantum steganography proposed by Martin are given in detail. The geometric coherence and 1/2-affinity coherence change substantially when the steganographic embedding rate is above 0.2, and a high steganographic detection rate and a low false alarm rate can be obtained according to the proposed protocol. Besides, the impact on QKD efficiency can be controlled by adjusting the detection rate or adopting sampling detection strategy. It proves that the proposed protocol has a satisfactory quantum steganalysis performance.
