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.
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.
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.
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 The ( t , n ) -threshold schemes offer significant advantages over n , n -threshold schemes due to their flexibility, fault tolerance, and practicality. In this paper, a ( t , n ) -threshold quantum secret-sharing (QSS) and quantum state sharing schemes based on single photons are proposed by incorporating unitary phase shift operations. The proposed scheme employs symmetric bivariate polynomials and utilizes polynomial interpolation for secret sharing. This approach facilitates the secure distribution of classical data and quantum states while maintaining confidentiality and integrity during transmission. Mutual identity authentication between the dealer and participants is ensured, and the accuracy of secret reconstruction is achieved using Lagrange interpolation. The analysis demonstrates that the proposed scheme is resilient against common interception methods, including eavesdropping attacks and participant-driven threats such as entanglement swapping. Additionally, the scheme is characterized by ease of implementation within physical frameworks and adaptability to various applications offering a practical and efficient alternative to existing methods.