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 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.
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.
A crucial issue with hybrid quantum secret sharing schemes is the amount of data that is allocated to the participants. The smaller the amount of allocated data, the better the performance of a scheme. Moreover, quantum data is very hard and expensive to deal with, therefore, it is desirable to use as little quantum data as possible. To achieve this goal, we first construct extended unitary operations by the tensor product of n, n ≥ 2, basic unitary operations, and then by using those extended operations, we design two quantum secret sharing schemes. The resulting dual compressible hybrid quantum secret sharing schemes, in which classical data play a complementary role to quantum data, range from threshold to access structure. Compared with the existing hybrid quantum secret sharing schemes, our proposed schemes not only reduce the number of quantum participants, but also the number of particles and the size of classical shares. To be exact, the number of particles that are used to carry quantum data is reduced to 1 while the size of classical secret shares also is also reduced to l−2/m−1 based on ((m+1, n′)) threshold and to l−2/r2 (where r2 is the number of maximal unqualified sets) based on adversary structure. Consequently, our proposed schemes can greatly reduce the cost and difficulty of generating and storing EPR pairs and lower the risk of transmitting encoded particles.
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.
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.
Secret sharing is a cryptographic scheme to encode a secret to multiple shares being distributed to participants, so that only qualified sets of participants can restore the original secret from their shares. When we encode a secret by a secret sharing scheme and distribute shares, sometimes not all participants are accessible, and it is desirable to distribute shares to those participants before a secret information is determined. Secret sharing schemes for classical secrets have been known to be able to distribute some shares before a given secret. Lie et al. found a ((2, 3))-threshold secret sharing for quantum secrets can distribute some shares before a given secret. However, it is unknown whether distributing some shares before a given secret is possible with other access structures of secret sharing for quantum secrets. We propose a quantum secret sharing scheme for quantum secrets that can distribute some shares before a given secret with other access structures.