Circular Semi-Quantum Secret Sharing Using Single Particles

Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography, and differs from quantum secret sharing (QSS) in that not all parties are required to possess quantum capabilities. All previous SQSS protocols have three common features: (i) they adopt product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a tree-type way; and (iii) they require the classical parties to possess the measurement capability. In this paper, two circular SQSS protocols with single particles are suggested, where the first one requires the classical parties to possess the measurement capability while the second one does not have this requirement. Compared with the previous SQSS protocols, the proposed SQSS protocols have some distinct features: (i) they adopt single particles rather than product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a circular way; and (iii) the second protocol releases the classical parties from the measurement capability. The proposed SQSS protocols are robust against some famous attacks from an eavesdropper, such as the measure-resend attack, the intercept-resend attack and the entangle-measure attack, and are feasible with present quantum technologies in reality.     

On “multiparty quantum secret sharing with Bell states and Bell measurements”

Recently, Shi et al. proposed a multiparty quantum secret sharing (QSS) using Bell states and Bell measurements. This study shows that their scheme has a pitfall that could be mounted to a collusion attack if precaution has not been taken in implementation. That is, two dishonest agents can collude to reveal the secret without the help of the others. A possible solution is also presented to avoid the attack.     

Participant attack on a kind of MQSS schemes based on entanglement swapping

A kind of multiparty quantum secret sharing (MQSS) schemes based on entanglement swapping is analyzed and an effective attack is proposed. Some unauthorized agent groups can recover the secret from the dealer with the help of this special attack. It is shown that entanglement swapping not only makes the MQSS protocols feasible but also brings a fatal drawback to them. Furthermore, a possible improvement on such protocols is proposed, which makes them secure against the proposed attack.     

Comment on “Reply to Comment on?‘Efficient?High-Capacity Quantum Secret Sharing with?Two-Photon Entanglement’?”

In Deng, Li, and Zhou (Phys. Lett. A 373:399, 2009), the authors propose two improved efficient high-capacity quantum secret sharing schemes to solve the problems existed in the Letter (Phys. Lett. A 372:1957, 2008), they claim that these two schemes are secure and efficient. However, we point out here that these two improved schemes are not secure as one agent can obtain all the information without the help from the other agent. We further modify this three-party quantum secret sharing scheme and make it really secure. In the end, we also give a method to generalize our quantum secret sharing scheme to arbitrary multi-party scheme.     

Analysis of a kind of quantum cryptographic schemes based on secret sharing

Recently, Yang et al. proposed a kind of quantum cryptographic schemes based on secret sharing. The main idea is drawn from the case, where any n participants who share a secret K can co-operate as K does. This process can be applied to encryption, authentication, signature and so on. Unfortunately, since there is no identity authentication of the share’s holder, these schemes inherit the limitation of secret sharing in practice. If some participants do not follow the protocol, the protocol would be a failu...     

Participant attack on quantum secret sharing based on entanglement swapping

The security of quantum secret sharing based on entanglement swapping is revisited and a participant attack is presented. In this attack two dishonest agents together can illegally recover the secret quantum state without the help of any other controller, and it will not be detected by any other users. Furthermore, by modifying the distribution process of particles and adding a detection step after each distribution process, we propose an improved protocol which can resist this kind of attack.     

A Generalized Information Theoretical Model for Quantum Secret Sharing

An information theoretical model for quantum secret sharing was introduced by H. Imai et al. (Quantum Inf. Comput. 5(1), 69–80 2005), which was analyzed by quantum information theory. In this paper, we analyze this information theoretical model using the properties of the quantum access structure. By the analysis we propose a generalized model definition for the quantum secret sharing schemes. In our model, there are more quantum access structures which can be realized by our generalized quantum secret sharing schemes than those of the previous one. In addition, we also analyse two kinds of important quantum access structures to illustrate the existence and rationality for the generalized quantum secret sharing schemes and consider the security of the scheme by simple examples.     

Quantum-Dot Spin-Based Secret Sharing in an Optical Microcavity

Two schemes of quantum secret sharing are proposed via single electron spin confined in charged QDs inside a single-sided microcavity and a double-sided microcavity, respectively. Both schemes rely on coherent photon-spin interaction. The two schemes are both deterministic and can be extended to multipartite secret sharing.     

Improving the security of multiparty quantum secret sharing based on the improved Boström-Felbinger protocol

In a recent paper [Z.J. Zhang et al., Opt. Commun. 269 (2007) 418], a protocol of multiparty quantum secret sharing was presented. We study the security of this protocol and found that it is not secure for a dishonest agent Charlie, who can illegally elicit half of Alice’s secret message by himself. Finally a feasible improvement of this quantum secret sharing protocol is proposed.     

Improving the security of multiparty quantum secret sharing against an attack with a fake signal

We come up with a special attack strategy to the multiparty quantum secret sharing protocol [Z.J. Zhang, Y. Li, Z.X. Man, Phys. Rev. A 71 (2005) 044301]. Using fake signal and Bell measurement, the agent Bob who generates the initial signals can elicit Alice's secret message. With little modification, our strategy also works for an improved version of this protocol. At last, a further improvement of the multiparty quantum secret sharing protocol is proposed.     

Quantum Ramp Secret Sharing Scheme and Quantum Operations

In order to improve the efficiency of quantum secret sharing, quantum ramp secret sharing schemes were proposed (Ogawa et al., Phys. Rev. A 72, 032318 [2005]), which had a trade-off between security and coding efficiency. In quantum ramp secret sharing, partial information about the secret is allowed to leak to a set of participants, called an intermediate set, which cannot fully reconstruct the secret. This paper revisits the size of a share in the quantum ramp secret scheme based on a relation between the quantum operations and the coherent information. We also propose an optimal quantum ramp secret sharing scheme.     

基于量子图态的量子秘密共享

本文基于量子图态的几何结构特征,利用生成矩阵分割法,提出了一种量子秘密共享方案.利用量子图态基本物理性质中的稳定子实现信息转移的模式、秘密信息的可扩展性以及新型的组恢复协议,为安全的秘密共享协议提供了多重保障.更重要的是,方案针对生成矩阵的循环周期问题和因某些元素不存在本原元而不能构造生成矩阵的问题提出了有效的解决方案.在该方案中,利用经典信息与量子信息的对应关系提取经典信息,分发者根据矩阵分割理论获得子秘密集,然后将子秘密通过酉操作编码到量子图态中,并分发给参与者,最后依据该文提出的组恢复协议及图态相关理论得到秘密信息.理论分析表明,该方案具有较好的安全性及信息的可扩展性,适用于量子网络通信中的秘密共享,保护秘密数据并防止泄露.     

High-Dimensional Circular Quantum Secret Sharing Using Orbital Angular Momentum

Quantum secret sharing is to distribute secret message securely between multi-parties. Here exploiting orbital angular momentum (OAM) state of single photons as the information carrier, we propose a high-dimensional circular quantum secret sharing protocol which increases the channel capacity largely. In the proposed protocol, the secret message is split into two parts, and each encoded on the OAM state of single photons. The security of the protocol is guaranteed by the laws of non-cloning theorem. And the secret messages could not be recovered except that the two receivers collaborated with each other. Moreover, the proposed protocol could be extended into high-level quantum systems, and the enhanced security could be achieved.     

Cryptanalysis and improvement of multiparty quantum secret sharing schemes

A scheme of multiparty quantum secret sharing of classical messages (QSSCM) [Z.J. Zhang et al., Opt. Commun. 269 (2007) 418] was proposed. Lin et al. [S. Lin et al., Opt. Commun. 281 (2008) 4553] showed the last agent can obtain half of the secret in Z.J. Zhang's et al. three-party QSSCM scheme and gave an improved version. We further show the first agent and the last agent can obtain all the secret without introducing any error in Zhang's et al. multiparty QSSCM scheme by a special attack with quantum teleportation. We also present an improved version.     

Cryptanalysis of multiparty quantum secret sharing with Bell states and Bell measurements

The security of multiparty quantum secret sharing with Bell states and Bell measurements [R.H. Shi et al., Opt. Commun. 283 (2010) 2476] is analyzed. It is shown that the first agent and the last one can gain access to the dealer's secret if they collaborate in this protocol. Therefore, this protocol does not satisfy the security requirement of quantum secret sharing.     

A （2, 3） quantum threshold scheme based on Greenberger-Horne-Zeilinger state

In this paper, by using properties of quantum controlled-not manipulation and entanglement states, we have designed a novel (2, 3) quantum threshold scheme based on the Greenberger- Horne -Zeilinger (GHZ) state. The proposed scheme involves two phases, i.e. a secret sharing phase and a secret phase. Detailed proofs show that the proposed scheme is of unconditional security. Since the secret is shared among three participants, the proposed scheme may be applied to quantum key distribution and secret sharing.     

An Improved Multiparty Quantum Secret Sharing with Bell States and Bell Measurement

A multiparty quantum secret sharing with Bell states and Bell measurement has been proposed by Shi et al., but it is not secure for two dishonest agents. In this paper, an improved scheme is proposed in order to prevent this attack and its security is also analyzed.     

Efficient Multiparty Quantum Secret Sharing of Secure Direct Communication Based on Bell States and Continuous Variable Operations

By using some ordered Bell states as quantum channel, we propose a protocol for multiparty quantum secret sharing of secure direct communication. The present scheme follows the ideas of dense coding and ping-pong technique. It has a high source capacity as each traveling photon carries two bits of classical secret messages, and has a high intrinsic efficiency because almost all the instances are useful. Since the continuous variable operations instead of the discrete unitary operations used usually are employed to realize the sharing controls, the security of the present protocol is therefore enhanced. Furthermore, due to existing multilevel security checking procedures, the present scheme can prevent against some usual attack strategies.     

A Secret Sharing Scheme for Quantum Gray and Color Images Based on Encryption

This paper is concerned with the better security of quantum image secret sharing (QISS) algorithm. The improved QISS (IQISS) scheme is implemented on both quantum gray image (FRQI) and quantum color image (MCQI). The new IQISS scheme comprises efficient sharing process and recovering process. The core idea of the sharing process is to combine encryption and measurement for two types of quantum secret images to acquire the quantum shadow images. In the recovering process, strip operation is firstly utilized on the shadow images. Afterwards, the decryption algorithm is used to recover the original quantum secret image. Experiments demonstrate that significant improvements in the security are in favor of the proposed approach.

     

The Cryptanalysis of Yuan et al.’s Multiparty Quantum Secret Sharing Protocol

Recently, Yuan et al. summarized some previous analysis of quantum secret sharing task and designed a multiparty quantum secret sharing protocol based on the continuous variable operations (CVO) with the ideas of dense coding and ping-pong technique (YMQSS). However, our research shows that the YMQSS protocol is unable to complete the quantum secret sharing task securely if the particular participant, Bob₀, is dishonest. In order to show that, we describe the following two attack strategies: one is that Bob₀ can get the accurate shared secrets himself and leave the other sharers get his forged ones; the other one is that Bob₀ can conspire with another sharer Bob _i (i≠0) to get Alice’s secrets without anyone’s help. Finally, our discussions and conclusions are proposed.