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

Quantum Secret Sharing for Multimedia with Progressive Reconstruction

Sougata Jana, Jaydeep Howlader

Published Jul 16, 2026• 0 citations
Publisher

Abstract

Abstract Threshold secret sharing enables the reconstruction of a secret only when sufficient participants collaborate. In this work, we propose an estimation-theoretic quantum secret sharing framework in which classical information encoded in the phase of a single-qubit state is recovered through finite-copy quantum estimation. Unlike conventional secret sharing schemes, the resulting access structure is governed by the fundamental limits of quantum parameter estimation rather than algebraic reconstruction. The framework naturally induces progressive reconstruction , where reconstruction fidelity improves with the available number of quantum copies. We further extend the approach to grayscale and RGB image sharing, yielding resource-dependent multimedia reconstruction. Qiskit simulations validate the theoretical analysis and demonstrate fidelity-aware secret recovery without the use of entanglement.

DOI
10.21203/rs.3.rs-10366506/v1

Related papers

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

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

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

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

Secret Sharing of a Quantum State

He Lu, Zhen Zhang, Luo-Kan Chen +7 more

Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share a certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold secret sharing scheme is confidentiality: with less than the designated number of players, no information can be recovered. Furthermore, in a quantum scenario, one additional critical criterion exists: the capability of sharing entangled and unknown quantum information. Here, by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%. By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion. Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which shows that our implemented scheme is fully quantum. Moreover, our experimental setup can be treated as a decoding circuit of the five-qubit quantum error-correcting code with two erasure errors.

arXiv:1604.08093•Physical Review Letters•Jul 13, 2016•105 citations
Abstract Threshold secret sharing enables the reconstruction of a secret only when sufficient participants collaborate. In this work, we propose an estimation-theoretic quantum secret sharing framework in which classical information encoded in the phase of a single-qubit state is recovered through finite-copy quantum estimation. Unlike conventional secret sharing schemes, the resulting access structure is governed by the fundamental limits of quantum parameter estimation rather than algebraic reconstruction. The framework naturally induces progressive reconstruction , where reconstruction fidelity improves with the available number of quantum copies. We further extend the approach to grayscale and RGB image sharing, yielding resource-dependent multimedia reconstruction. Qiskit simulations validate the theoretical analysis and demonstrate fidelity-aware secret recovery without the use of entanglement.
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.
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 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.
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.
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.
Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share a certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold secret sharing scheme is confidentiality: with less than the designated number of players, no information can be recovered. Furthermore, in a quantum scenario, one additional critical criterion exists: the capability of sharing entangled and unknown quantum information. Here, by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%. By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion. Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which shows that our implemented scheme is fully quantum. Moreover, our experimental setup can be treated as a decoding circuit of the five-qubit quantum error-correcting code with two erasure errors.