Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)

Flexible Quantum Image Secret Sharing Based on Measurement and Strip

Xianhua Song, Shen Wang, Jianzhi Sang, Xuehu Yan, Xiamu Niu

Published Aug 1, 2014• 8 citations
Publisher

Abstract

A flexible (2k, 2k) quantum image secret sharing (QISS) is proposed for the first time based on 1-qubit measurement scheme and the idea of strip. Through simple quantum measurements, a quantum image can be generated into 2k shares. When recovering the original secret image, strip operations which are proposed in quantum movie are applied on the shares and the secret image can be recovered in one piece. Compared with the polynomial interpolation based quantum state sharing method, QISS needn't map the quantum secret state to a new encoding. Moreover, the shares in QISS are still quantum images and the sizes of them are smaller than the original one.

DOI
10.1109/iih-msp.2014.60

Related papers

A Novel Quantum Visual Secret Sharing Scheme

Wenjie Liu, Yinsong Xu, Maojun Zhang +2 more

Inspired by Naor et al.'s visual secret sharing (VSS) scheme, a novel n out of n quantum visual secret sharing (QVSS) scheme is proposed, which consists of two phases: sharing process and recovering process. In the first process, the color information of each pixel from the original secret image is encoded into an n-qubit superposition state by using the strategy of quantum expansion instead of classical pixel expansion, and then these n qubits are distributed as shares to n participants, respectively. During the recovering process, all participants cooperate to collect these n shares of each pixel together, then perform the corresponding measurement on them, and execute the n-qubit XOR operation to recover each pixel of the secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes and perfectly solves the problem that in the classic VSS schemes the recovered image has the loss in resolution. Moreover, its experiment implementation with the IBM Q is conducted to demonstrate the practical feasibility.

arXiv:2309.13659•IEEE Access•Jan 1, 2019•20 citations

Novel quantum secret image-sharing scheme

Gaofeng Luo, Ri‐Gui Zhou, WenWen Hu

In this paper, we propose a novel quantum secret image-sharing scheme which constructs m quantum secret images into m +1 quantum share images. A chaotic image generated by the logistic map is utilized to assist in the construction of quantum share images first. The chaotic image and secret images are expressed as quantum image representation by using the novel enhanced quantum representation. To enhance the confidentiality, quantum secret images are scrambled into disordered images through the Arnold transform. Then the quantum share images are constructed by performing a series of quantum swap operations and quantum controlled-NOT operations. Because all quantum operations are invertible, the original quantum secret images can be reconstructed by performing a series of inverse operations. Theoretical analysis and numerical simulation proved both the security and low computational complexity of the scheme, which has outperformed its classical counterparts. It also provides quantum circuits for sharing and recovery processes.

Chinese Physics B•Apr 1, 2019•19 citations

Multiple Multi-Qubit Quantum States Sharing

Huawang Qin, Yuewei Dai

Abstract A multiple multi-qubit quantum states sharing scheme is proposed, in which the dealer can share multiple multi-qubit quantum states among the participants through only one distribution and one recovery. The dealer encodes the secret quantum states into a special entangled state, and then distributes the particles of the entangled state to the participants. The participants perform the single-particle measurements on their particles, and can cooperate to recover the multiple multi-qubit quantum states. Compared to the existing schemes, our scheme is more efficient and more flexible in practice.

Communications in Theoretical Physics•Apr 1, 2016•1 citation

A (t, n) threshold quantum visual secret sharing

Wenjie Liu, Yinsong Xu, Junxiu Chen +1 more

Secure data sharing is a deserving topic in wireless sensor networks. In order to deliver the information securely, we propose a (t, n) threshold quantum visual secret sharing (QVSS) scheme based on Naor et al.'s visual secret sharing (VSS) scheme, which consists of two phases: sharing process and recovering process. In the firs process, the colour information of each pixel from the original secret image is encoded into an n × m-qubit superposition state, and then these qubits are distributed as shares to all participants, respectively. During the recovering process, at least t participants cooperate to collect these shares of each pixel together, then perform the corresponding measurements and recovering algorithm to recover the whole secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes. In addition, the performance evaluation of the scheme is discussed theoretically, and its experiment implementation with IBM Q is conducted to demonstrate the practical feasibility.

International Journal of Sensor Networks•Jan 1, 2020•7 citations

A (t, n) threshold quantum visual secret sharing

Junxiu Chen, Ching‐Nung Yang, Wenjie Liu +1 more

Secure data sharing is a deserving topic in wireless sensor networks. In order to deliver the information securely, we propose a (t, n) threshold quantum visual secret sharing (QVSS) scheme based on Naor et al.'s visual secret sharing (VSS) scheme, which consists of two phases: sharing process and recovering process. In the firs process, the colour information of each pixel from the original secret image is encoded into an n × m-qubit superposition state, and then these qubits are distributed as shares to all participants, respectively. During the recovering process, at least t participants cooperate to collect these shares of each pixel together, then perform the corresponding measurements and recovering algorithm to recover the whole secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes. In addition, the performance evaluation of the scheme is discussed theoretically, and its experiment implementation with IBM Q is conducted to demonstrate the practical feasibility.

International Journal of Sensor Networks•Jan 1, 2020•0 citations

An Efficient Multiparty Quantum-State Sharing Scheme

Huawang Qin, Yuewei Dai

An efficient multiparty quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret by performing the operations of quantum-controlled-not and Hadamard gate. The participants perform the single-particle measurements on their particles, and then can cooperate to recover the original quantum state. In our scheme, both the dealer and the participants do not need to perform the entanglement measurement. Compared with the existing schemes, our scheme is simpler and more efficient.

Chinese Physics Letters•Oct 1, 2015•1 citation
A flexible (2k, 2k) quantum image secret sharing (QISS) is proposed for the first time based on 1-qubit measurement scheme and the idea of strip. Through simple quantum measurements, a quantum image can be generated into 2k shares. When recovering the original secret image, strip operations which are proposed in quantum movie are applied on the shares and the secret image can be recovered in one piece. Compared with the polynomial interpolation based quantum state sharing method, QISS needn't map the quantum secret state to a new encoding. Moreover, the shares in QISS are still quantum images and the sizes of them are smaller than the original one.
Inspired by Naor et al.'s visual secret sharing (VSS) scheme, a novel n out of n quantum visual secret sharing (QVSS) scheme is proposed, which consists of two phases: sharing process and recovering process. In the first process, the color information of each pixel from the original secret image is encoded into an n-qubit superposition state by using the strategy of quantum expansion instead of classical pixel expansion, and then these n qubits are distributed as shares to n participants, respectively. During the recovering process, all participants cooperate to collect these n shares of each pixel together, then perform the corresponding measurement on them, and execute the n-qubit XOR operation to recover each pixel of the secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes and perfectly solves the problem that in the classic VSS schemes the recovered image has the loss in resolution. Moreover, its experiment implementation with the IBM Q is conducted to demonstrate the practical feasibility.
In this paper, we propose a novel quantum secret image-sharing scheme which constructs m quantum secret images into m +1 quantum share images. A chaotic image generated by the logistic map is utilized to assist in the construction of quantum share images first. The chaotic image and secret images are expressed as quantum image representation by using the novel enhanced quantum representation. To enhance the confidentiality, quantum secret images are scrambled into disordered images through the Arnold transform. Then the quantum share images are constructed by performing a series of quantum swap operations and quantum controlled-NOT operations. Because all quantum operations are invertible, the original quantum secret images can be reconstructed by performing a series of inverse operations. Theoretical analysis and numerical simulation proved both the security and low computational complexity of the scheme, which has outperformed its classical counterparts. It also provides quantum circuits for sharing and recovery processes.
Abstract A multiple multi-qubit quantum states sharing scheme is proposed, in which the dealer can share multiple multi-qubit quantum states among the participants through only one distribution and one recovery. The dealer encodes the secret quantum states into a special entangled state, and then distributes the particles of the entangled state to the participants. The participants perform the single-particle measurements on their particles, and can cooperate to recover the multiple multi-qubit quantum states. Compared to the existing schemes, our scheme is more efficient and more flexible in practice.
Secure data sharing is a deserving topic in wireless sensor networks. In order to deliver the information securely, we propose a (t, n) threshold quantum visual secret sharing (QVSS) scheme based on Naor et al.'s visual secret sharing (VSS) scheme, which consists of two phases: sharing process and recovering process. In the firs process, the colour information of each pixel from the original secret image is encoded into an n × m-qubit superposition state, and then these qubits are distributed as shares to all participants, respectively. During the recovering process, at least t participants cooperate to collect these shares of each pixel together, then perform the corresponding measurements and recovering algorithm to recover the whole secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes. In addition, the performance evaluation of the scheme is discussed theoretically, and its experiment implementation with IBM Q is conducted to demonstrate the practical feasibility.
Secure data sharing is a deserving topic in wireless sensor networks. In order to deliver the information securely, we propose a (t, n) threshold quantum visual secret sharing (QVSS) scheme based on Naor et al.'s visual secret sharing (VSS) scheme, which consists of two phases: sharing process and recovering process. In the firs process, the colour information of each pixel from the original secret image is encoded into an n × m-qubit superposition state, and then these qubits are distributed as shares to all participants, respectively. During the recovering process, at least t participants cooperate to collect these shares of each pixel together, then perform the corresponding measurements and recovering algorithm to recover the whole secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes. In addition, the performance evaluation of the scheme is discussed theoretically, and its experiment implementation with IBM Q is conducted to demonstrate the practical feasibility.
An efficient multiparty quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret by performing the operations of quantum-controlled-not and Hadamard gate. The participants perform the single-particle measurements on their particles, and then can cooperate to recover the original quantum state. In our scheme, both the dealer and the participants do not need to perform the entanglement measurement. Compared with the existing schemes, our scheme is simpler and more efficient.