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

Chinese Physics Letters

Efficient Multiparty-to-Multiparty Quantum Secret Sharing via Continuous Variable Operations

Lian-Fang Han, Yimin Liu, Yuan Hao, Zhanjun Zhang

Published Dec 1, 2007• 29 citations
Publisher

Abstract

The one-to-multiparty quantum secret sharing scheme [Phys. Rev. A 71 (2005) 044301] proposed recently is extended to a multiparty-to-multiparty case. Furthermore, the continuous variable operations are employed in the extended scheme to replace the specific discrete unitary operations used in the original scheme. The complete randomicity of the continuous variable characterizing the unitary operations can ensure the security of secret sharing. Moreover, the present scheme is compared with the recent similar scheme [Phys. Rev. A 72 (2005) 012304]. It is found that the efficiency of the present scheme is n times of that of the previous one.

DOI
10.1088/0256-307x/24/12/006

Related papers

Efficient Multiparty-to-Multiparty Quantum Secret Sharing via Continuous Variable Operations

韩莲芳, 刘益民, 袁浩 +1 more

one-to-multiparty 量秘密分享的计划[Phys。加快。一 71 (2005 ) 044301 ] 最近求婚了被扩大到一个 multiparty-to-multiparty 盒子。而且，连续可变操作在扩大计划被采用代替在原来的计划使用的特定的分离单一的操作。描绘单一的操作的连续变量的完全的 randomicity 能保证秘密分享的安全。而且，现在的计划与最近的类似的计划相比[Phys。加快。一 72 (2005 ) 012304 ] 。现在的计划的效率是以前的那的 n 时间，这被发现。

Chinese Physics Letters•Jan 1, 2007•0 citations

Cryptanalysis and Improvement of a Quantum Secret Sharing Protocol between Multiparty and Multiparty with Single Photons and Unitary Transformations

Zhen-Chao Zhu, Yuqing Zhang

In a recent paper [ Chin. Phys. Lett 25(2008)1187 ], a quantum secret sharing scheme between multiparty and multiparty was presented. We show that the protocol is not secure because the last member in Alice's group can illegally obtain most secret messages without introducing any error. Finally, a possible way to avoid the security flaw is suggested.

Chinese Physics Letters•Jun 1, 2010•11 citations

Cryptanalysis and improvement of efficient multiparty quantum secret sharing based on a novel structure and single qubits

Gan Gao

Abstract In the paper (EPJ Quant. Technol. 10:29, 2023), Kuo et al. proposed a multiparty quantum secret sharing protocol based on a novel structure and single qubits. Owing to the absence of an entanglement state, the proposed protocol is more practical than other quantum secret sharing protocols which use entanglement properties. Therefore, we study the security of the proposed protocol and find there exists a security loophole in the n-party ( $n\geq 4$ n ≥ 4 ) secret sharing case in it, that is, two dishonest agents can collude to obtain (part of) Alice’s secret without the help of the other agents. In order to overcome the security loophole, we give an improved protocol and make a security analysis for it. By calculating, the qubit efficiency of the three-party case in it is equal to $\frac{1}{8}$ 1 8 , which is higher than that in Hillery et al.’s protocol (Phys. Rev. A 59:1829, 1999).

EPJ Quantum Technology•Mar 25, 2024•8 citations

An efficient multiparty quantum secret sharing scheme using a single qudit

WenWen Hu, Bangshu Xiong, Ri‐Gui Zhou

The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.

Chinese Physics B•Nov 17, 2022•7 citations

An Efficient Multiparty Quantum-State Sharing Scheme

Huawang Qin, Yuewei Dai

An efficient multiparty quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret by performing the operations of quantum-controlled-not and Hadamard gate. The participants perform the single-particle measurements on their particles, and then can cooperate to recover the original quantum state. In our scheme, both the dealer and the participants do not need to perform the entanglement measurement. Compared with the existing schemes, our scheme is simpler and more efficient.

Chinese Physics Letters•Oct 1, 2015•1 citation

Advanced Multiparty Quantum Secret Sharing using Entanglement Swapping

N.T.V. Luu, S. Shimamoto

A multiparty quantum secret sharing scheme is proposed to utilize the magic properties of entanglement swapping. In this scheme, a set of (2N-1) EPR pairs is used to encode and distribute a secret message to (N-1) parties. Each secret message will be split into (N-1) packets. By performing the local unitary operations and entanglement swapping, each classical bit packet will be encoded secretly into Bell states so no subset of parties but their entire cooperation can read out the original secret message. The security of this proposed scheme is also considered.

•Oct 24, 2006•1 citation
The one-to-multiparty quantum secret sharing scheme [Phys. Rev. A 71 (2005) 044301] proposed recently is extended to a multiparty-to-multiparty case. Furthermore, the continuous variable operations are employed in the extended scheme to replace the specific discrete unitary operations used in the original scheme. The complete randomicity of the continuous variable characterizing the unitary operations can ensure the security of secret sharing. Moreover, the present scheme is compared with the recent similar scheme [Phys. Rev. A 72 (2005) 012304]. It is found that the efficiency of the present scheme is n times of that of the previous one.
one-to-multiparty 量秘密分享的计划[Phys。加快。一 71 (2005 ) 044301 ] 最近求婚了被扩大到一个 multiparty-to-multiparty 盒子。而且，连续可变操作在扩大计划被采用代替在原来的计划使用的特定的分离单一的操作。描绘单一的操作的连续变量的完全的 randomicity 能保证秘密分享的安全。而且，现在的计划与最近的类似的计划相比[Phys。加快。一 72 (2005 ) 012304 ] 。现在的计划的效率是以前的那的 n 时间，这被发现。
Abstract In the paper (EPJ Quant. Technol. 10:29, 2023), Kuo et al. proposed a multiparty quantum secret sharing protocol based on a novel structure and single qubits. Owing to the absence of an entanglement state, the proposed protocol is more practical than other quantum secret sharing protocols which use entanglement properties. Therefore, we study the security of the proposed protocol and find there exists a security loophole in the n-party ( n≥4n\geq 4n≥4 n ≥ 4 ) secret sharing case in it, that is, two dishonest agents can collude to obtain (part of) Alice’s secret without the help of the other agents. In order to overcome the security loophole, we give an improved protocol and make a security analysis for it. By calculating, the qubit efficiency of the three-party case in it is equal to 18\frac{1}{8}81​ 1 8 , which is higher than that in Hillery et al.’s protocol (Phys. Rev. A 59:1829, 1999).
The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.
An efficient multiparty quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret by performing the operations of quantum-controlled-not and Hadamard gate. The participants perform the single-particle measurements on their particles, and then can cooperate to recover the original quantum state. In our scheme, both the dealer and the participants do not need to perform the entanglement measurement. Compared with the existing schemes, our scheme is simpler and more efficient.
A multiparty quantum secret sharing scheme is proposed to utilize the magic properties of entanglement swapping. In this scheme, a set of (2N-1) EPR pairs is used to encode and distribute a secret message to (N-1) parties. Each secret message will be split into (N-1) packets. By performing the local unitary operations and entanglement swapping, each classical bit packet will be encoded secretly into Bell states so no subset of parties but their entire cooperation can read out the original secret message. The security of this proposed scheme is also considered.