This paper constructs a class of verifiable secret sharing scheme based on Chinese Remainder Theorem and Bell states.In the distribution phase,Alice distributes the shares to the participants through the quantum secure channel.In the recovery phase,Alice generates a two-bit Bell state in Hilbert space,and then the participants and Alice perform some unitary operations on the Bell state to reconstruct the secret.Analysis results show the scheme can resist intercepted retransmission attack,entangled measunement attack,participants attack,and trojan horse attack.
This paper constructs a class of verifiable secret sharing scheme based on Chinese Remainder Theorem and Bell states.In the distribution phase,Alice distributes the shares to the participants through the quantum secure channel.In the recovery phase,Alice generates a two-bit Bell state in Hilbert space,and then the participants and Alice perform some unitary operations on the Bell state to reconstruct the secret.Analysis results show the scheme can resist intercepted retransmission attack,entangled measunement attack,participants attack,and trojan horse attack.
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 In this paper, we propose an efficient multiparty quantum direct secret sharing scheme based on Bell state and Bell measurements. In our scheme, the secret information can be directly encoded into the second particles of Bell states through the local unitary operations. In order to increase the number of participants, we use the controlled-NOT gate to produce the final multipartite entangled states. In the reconstruction phase, each participant performs Bell measurements for their particles and obtains the final key strings. Furthermore, they cooperate to recover the secret information. In addition, we give a concrete example with four participants to demonstrate more clearly the integrity of our scheme. Finally, we demonstrate that our protocol can resist both collusion attack and intercept-and-resend attack.
The emerging quantum technology has highlighted the necessity for secure and efficient secret sharing in quantum networks. In this paper, we introduce a verifiable multiparty counterfactual quantum secret sharing (QSS) protocol, enhancing security and efficiency. This QSS protocol utilizes a low-depth quantum circuit to encrypt and decrypt information, which comprises a unitary operator constructed using a preshared secret key. To ensure the robustness and verifiability of the shared secret key, the protocol imposes constraints on the participants with the Chinese remainder theorem. The most significant advantage of our proposed QSS protocol is incorporating counterfactual communication, which considerably enhances the scheme’s security by enabling exchange-free information sharing among participants, thereby minimizing the risk of eavesdropping or intercept-and-resend attacks. Furthermore, we incorporate a weighted-threshold mechanism that provides flexibility, enabling diverse use cases to design security protocols for quantum networks. The security analysis of the counterfactual QSS protocol and its implementation on IBM Quantum computers reveals strong resilience to internal and external attacks, along with high efficiency and robustness, making it effective for quantum encryption in the noisy intermediate-scale quantum era.
Focused on the issue that the quantum secret sharing is limited to the maximally entangled state,a scheme for quantum state sharing of an arbitrary unknown N-qubit state by using entangled state as quantum channel was proposed. The sender Alice used the Bell basis measurement and then the receiver Bob or Charlie used the single particle measurement. The participants chose the right joint unitary operation according to the results from Alice and the signal measurement,which could realize arbitrary N-qubit secret sharing. The eavesdropping analysis shows explicitly that the scheme is secure and it can resist the external eavesdropper and internal dishonest participant.
A novel quantum secret sharing (QSS) scheme is proposed on the basis of Chinese Remainder Theorem (CRT). In the scheme, the classical messages are mapped to secret sequences according to CRT equations, and distributed to different receivers by different dimensional superdense-coding respectively. CRT's secret sharing function, together with high-dimensional superdense-coding, provide convenience, security, and large capability quantum channel for secret distribution and recovering. Analysis shows the security of the scheme.
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.