As an important branch of quantum secure multi-party computation, quantum secret sharing (QSS) can distribute secret information among dishonest network nodes without revealing the secrets. In this study, a new four-party QSS protocol based on locally indistinguishable orthogonal product (LIOP) states is first proposed for quantum network communication. Then, the general multiparty QSS model based on LIOP states will be expanded. Combined with the property of LIOP states and obfuscating operation, the source node can send the secrets to different destination nodes in the quantum network. Accordingly, it is proven that the destination nodes have to work together to recover the shared secrets against some existing attacks. Furthermore, no entangled resources and complicated operations are required in the presented protocol. We hope the results could make positive effects to the development of quantum secure communication in the future.
As an important branch of quantum secure multi-party computation, quantum secret sharing (QSS) can distribute secret information among dishonest network nodes without revealing the secrets. In this study, a new four-party QSS protocol based on locally indistinguishable orthogonal product (LIOP) states is first proposed for quantum network communication. Then, the general multiparty QSS model based on LIOP states will be expanded. Combined with the property of LIOP states and obfuscating operation, the source node can send the secrets to different destination nodes in the quantum network. Accordingly, it is proven that the destination nodes have to work together to recover the shared secrets against some existing attacks. Furthermore, no entangled resources and complicated operations are required in the presented protocol. We hope the results could make positive effects to the development of quantum secure communication in the future.
As an important branch of quantum-secure multiparty computation, quantum-secure multiparty summation enables participants to complete the summation of their inputs without revealing their own secrets. In this paper, a new multiparty quantum secure summation protocol based on locally indistinguishable orthogonal product (LIOP) states is proposed. Leveraging the properties of LIOP states, participants can successfully accomplish the summation of their secrets with the assistance of a semi-honest third party (TP). The present protocol is shown to effectively resist certain existing attacks. Furthermore, complex operations and entanglement resources are not required in the proposed protocol. We anticipate that these results will contribute positively to the future development of quantum-secure multiparty computation.
Quantum secret sharing (QSS) is a cryptographic protocol that utilizes fundamental principles of quantum mechanics to securely distribute and reconstruct secret information among multiple participants. Most existing protocols rely on entangled states (such as Bell and GHZ states), but in practical applications. The preparation of entangled state is constrained by a short quantum coherence time, low state fidelity, etc., which makes it difficult to implement entangled resource-dependent QSS protocols. In this work, a novel practical and verifiable multi-party QSS protocol is proposed based on orthogonal product states, which are easier to prepare than entangled states. During the protocol preparation stage, the secret distributor first converts pre-shared classical secret information into the corresponding orthogonal product states according to the encoding rules, and pre-shares a communication key with participants via quantum key distribution (QKD), which is used to hide the initial quantum sequence information through subsequent particle transformation operations. After preparing the orthogonal product states, the distributor reorganizes the particles by position, extracting particles at the same position from each state to form new sequences, shuffling their order, then applying Hadamard operations using a pre-shared key, inserting decoy particles, and sending the sequences to the participants. After receiving it, participants conduct eavesdropping detection, use the same key for the inverse transformations, retain one particle from each sequence, and sequentially pass the remaining particles until the last participant receives a complete set, triggering state verification with the arbiter distributor. If the verification is successful, the particles will be returned to the first participant and the return stage will follow the same procedure. Only after both the transmission and return stage verifications have passed, will the distributor reveal the initial particle positions, allowing participants to collaboratively reconstruct the secret. In the protocol, the secret distributor acts as an arbitrator to verify the particle state information together with participants at designated points (the end of the transmission stage and the end of the return stage) in order to determine whether the particle-state information is error-free during transmission. If the verification fails at either stage, the protocol will be terminated immediately. Meanwhile, considering that the number of participants may change during the execution of the protocol, a dynamic scheme for personnel changes is designed to ensure the flexibility of the protocol. Through the analysis of possible internal and external attacks, It can be proven that our protocol can effectively resist the existing common attack. Using Qiskit simulation experiments, the core quantum procedures of the protocol can be successfully modeled. The experimental results provide strong computational validation of the theoretical feasibility of the protocol.
With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.
Classical secret sharing proposed by Shamir used classical computational power in classical cryptography to achieve secret key sharing, but with the advent of quantum systems, computational power can be overruled. To ensure a secure secret sharing scheme independent of computational power, a scheme independent of computational complexity is needed to achieve security. This paper will provide a protocol dependent on inherent secure nature of quantum cryptography (quantum no cloning theorem and quantum measurement rule). A secure multiparty quantum secret sharing scheme has been proposed to ensure that no one can eavesdrop or extract any share of the secret message via inherent security provided by quantum entanglement swapping and quantum teleportation. Entanglement swapping is a process that allows two non-interacting quantum systems to be entangled. Whereas, Quantum teleportation allows a party to send a qubit to another entangled party without sending the qubit over the channel. Moreover, in order to ensure security against possible active attacks, sender himself will generate and distribute EPR pairs to be used in the scheme. Result will be a secure multiparty QSS scheme which will be secure against internal and external eavesdropping, masquerading and brute-force attacks.
Secret sharing is a conventional technique for realizing secure communications in information networks, where a dealer distributes to n players a secret, which can only be decoded through the cooperation of k (n/2<k≤n) players. In recent years, quantum resources have been employed to enhance security of secret sharing, which has been named quantum secret sharing (QSS). A multipartite bound entanglement (BE) state of an optical field, due to its special entanglement features, can be used in quantum networks to improve security and flexibility of communication. We design and experimentally demonstrate a QSS protocol, where the dealer modulates a secret on a four-partite BE state and then distributes the submodes of the BE state to four spatially separated players. The presented QSS scheme has the capability to protect secrets from eavesdropping and dishonest players, because a nonlocal and deterministic BE state is shared among four authorized players.
Quantum secret sharing (QSS) is the result of merging the principles of quantum mechanics with secret information sharing. It enables a sender to share a secret among receivers, and the receivers can then collectively recover the secret when the need arises. To enhance the practicality of these quantum protocols, an innovative concept of quantum anonymous secret sharing (QASS) is advanced. In this paper, we propose a QASS protocol via W states, which can share secrets while ensuring recover-ability, recover-security, and recover-anonymity. We have rigorously evaluated our protocols, verifying their accuracy and fortifying their security against scenarios involving the active adversary. This includes considerations for dishonest receivers and non-receivers. Moreover, acknowledging the imperfections inherent in real-world communication channels, we have also undertaken an exhaustive analysis of our protocol's security and effectiveness in a quantum network where some form of noise is present. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.