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 Journal of Sensor Networks

A (t, n) threshold quantum visual secret sharing

Junxiu Chen, Ching‐Nung Yang, Wenjie Liu, Yinsong Xu

Published Jan 1, 2020• 7 citations
Publisher

Abstract

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.

DOI
10.1504/ijsnet.2020.107863

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•23 citations

A novel verifiable weighted threshold quantum secret sharing scheme

Yumin Dong, Yi Luo, Yanying Fu

Abstract Threshold quantum secret sharing is a cryptography technique for dividing and reconstructing secret information. The dealer shares a secret based on quantum mechanics principles, and a subset of participants cooperate to recover that secret. For example, in k , n quantum threshold scheme and n , n quantum threshold scheme, the former can only reconstruct the secret when at least k shares are collected. The latter requires all n shares to be collected to reconstruct the secret. However, in real scenarios, the priority of participant identities may vary. In order to meet the actual needs of participants with different rights, this paper proposes a w , ω , n quantum secret sharing (QSS) scheme. When the sum of participants’ weights w is greater than or equal to a threshold ω, they can cooperate to reconstruct the secret. In order to achieve this, this paper uses the entangled state of single particles and constructs a verifiable QSS scheme based on the Chinese remainder theorem. Significantly, in case of a dishonest participant, the dealer can delete the participant before recovering the secret to ensure the security of the communication. This scheme is more flexible than other threshold protocols. At the same time, it reduces the communication cost of the participants. In addition, security analysis shows that the scheme resists typical external and internal attacks.

Physica Scripta•Apr 21, 2023•7 citations

A ( t , n )-threshold dynamic quantum secret sharing scheme based on two-particle quantum states

Xi-Heng Ding, 姜东焕 JIANG Dong-huan, Yu-Guang 宇光 Yang 杨 +1 more

Abstract Quantum secret sharing is an important branch of quantum cryptography. In this paper, we propose a ( t , n )-threshold dynamic quantum secret sharing scheme based on two-particle quantum states. By combining Shamir’s polynomial structure with sequential quantum operations, any t authorized participants can jointly reconstruct the shared secret, while fewer than t participants cannot obtain useful information. In the recovery phase, the weighted shares of the authorized participants are successively encoded into a transmitted two-particle quantum state, and random numbers are introduced to protect the intermediate quantum information. Moreover, the proposed scheme supports participant addition and deletion without changing the original secret. A new participant can obtain a valid share with the cooperation of an authorized subset, whereas the old shares of deleted participants are invalidated by refreshing the sharing polynomial. The correctness analysis shows that the secret can be accurately recovered by an authorized subset. The security analysis addresses selected attacks under the stated assumptions, but does not establish integrity protection against active state modification. Therefore, the proposed scheme achieves flexible threshold reconstruction and dynamic participant management based on two-particle quantum states.

Chinese Physics B•Nov 4, 2026•0 citations

Quantum color visual cryptography scheme

Mengyao Liu, Peijun Zhao

Quantum visual cryptography (QVC) improves the security of traditional schemes. However, current QVC schemes are mainly limited to encrypting black-and-white binary images. In this paper, a split-channel quantum color visual cryptography (QCVC) scheme based on multi-secret encryption is proposed. In the sharing phase, the color image is divided into three channels. After halftone processing, it is encoded as three secret images, and two shares are generated and distributed to two participants. In the recovery phase, the three-channel images are decoded after quantum OR operation. Finally, a merge is performed to recover the original color secret image. We validated the security and feasibility of the proposed scheme through experiments.

International Conference on Applied Mathematics, Modelling and Intelligent Computing (CAMMIC)•Jun 5, 2025•0 citations

A threshold secret-sharing scheme for multiple quantum images based on a hybrid two-layer access structure

Yewei Wang, Zhihui Li, Chenhao Li +1 more

Abstract To address the lack of differentiated access control between master-key shares and image shares in existing multiple quantum image secret-sharing schemes, as well as the increase in the color-register width of an individual quantum image with the number of secret images, this paper presents a hybrid two-layer secret-sharing design integrating established threshold-sharing techniques with block-based novel enhanced quantum representation (NEQR) encoding. First, key-derived images and a cyclic XOR structure are used to establish associations among multiple secret images, while an anchor image is introduced to enable recursive reconstruction and closed-loop consistency verification. Shamir threshold sharing is then applied separately to the master key and the image information, forming a role-separated two-layer access structure. Furthermore, complete finite-field shares are partitioned into blocks and prepared as quantum images using the NEQR model, thereby reducing the register size of each individual quantum image. Simulation results show that the secret images can be correctly reconstructed only when the authorized participant set simultaneously satisfies both threshold conditions. The resulting block quantum images effectively conceal the visual and statistical characteristics of the original images, while the scheme provides flexible access control with a reasonable trade-off in quantum resource overhead.

Laser Physics•Nov 3, 2026•0 citations

An Efficient Quantum Secret Sharing Scheme Based on Restricted Threshold Access Structure

Lei Li, Zhi Zhou Li

Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.

Entropy•Jan 31, 2023•12 citations
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.
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.
Abstract Threshold quantum secret sharing is a cryptography technique for dividing and reconstructing secret information. The dealer shares a secret based on quantum mechanics principles, and a subset of participants cooperate to recover that secret. For example, in k , n quantum threshold scheme and n , n quantum threshold scheme, the former can only reconstruct the secret when at least k shares are collected. The latter requires all n shares to be collected to reconstruct the secret. However, in real scenarios, the priority of participant identities may vary. In order to meet the actual needs of participants with different rights, this paper proposes a w , ω , n quantum secret sharing (QSS) scheme. When the sum of participants’ weights w is greater than or equal to a threshold ω, they can cooperate to reconstruct the secret. In order to achieve this, this paper uses the entangled state of single particles and constructs a verifiable QSS scheme based on the Chinese remainder theorem. Significantly, in case of a dishonest participant, the dealer can delete the participant before recovering the secret to ensure the security of the communication. This scheme is more flexible than other threshold protocols. At the same time, it reduces the communication cost of the participants. In addition, security analysis shows that the scheme resists typical external and internal attacks.
Abstract Quantum secret sharing is an important branch of quantum cryptography. In this paper, we propose a ( t , n )-threshold dynamic quantum secret sharing scheme based on two-particle quantum states. By combining Shamir’s polynomial structure with sequential quantum operations, any t authorized participants can jointly reconstruct the shared secret, while fewer than t participants cannot obtain useful information. In the recovery phase, the weighted shares of the authorized participants are successively encoded into a transmitted two-particle quantum state, and random numbers are introduced to protect the intermediate quantum information. Moreover, the proposed scheme supports participant addition and deletion without changing the original secret. A new participant can obtain a valid share with the cooperation of an authorized subset, whereas the old shares of deleted participants are invalidated by refreshing the sharing polynomial. The correctness analysis shows that the secret can be accurately recovered by an authorized subset. The security analysis addresses selected attacks under the stated assumptions, but does not establish integrity protection against active state modification. Therefore, the proposed scheme achieves flexible threshold reconstruction and dynamic participant management based on two-particle quantum states.
Quantum visual cryptography (QVC) improves the security of traditional schemes. However, current QVC schemes are mainly limited to encrypting black-and-white binary images. In this paper, a split-channel quantum color visual cryptography (QCVC) scheme based on multi-secret encryption is proposed. In the sharing phase, the color image is divided into three channels. After halftone processing, it is encoded as three secret images, and two shares are generated and distributed to two participants. In the recovery phase, the three-channel images are decoded after quantum OR operation. Finally, a merge is performed to recover the original color secret image. We validated the security and feasibility of the proposed scheme through experiments.
Abstract To address the lack of differentiated access control between master-key shares and image shares in existing multiple quantum image secret-sharing schemes, as well as the increase in the color-register width of an individual quantum image with the number of secret images, this paper presents a hybrid two-layer secret-sharing design integrating established threshold-sharing techniques with block-based novel enhanced quantum representation (NEQR) encoding. First, key-derived images and a cyclic XOR structure are used to establish associations among multiple secret images, while an anchor image is introduced to enable recursive reconstruction and closed-loop consistency verification. Shamir threshold sharing is then applied separately to the master key and the image information, forming a role-separated two-layer access structure. Furthermore, complete finite-field shares are partitioned into blocks and prepared as quantum images using the NEQR model, thereby reducing the register size of each individual quantum image. Simulation results show that the secret images can be correctly reconstructed only when the authorized participant set simultaneously satisfies both threshold conditions. The resulting block quantum images effectively conceal the visual and statistical characteristics of the original images, while the scheme provides flexible access control with a reasonable trade-off in quantum resource overhead.
Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.