A Quantum Secret Sharing Scheme Using Orbital Angular Momentum onto Multiple Spin States Based on Fibonacci Compression Encoding

Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-photon spin-orbit entanglement, we propose a quantum secret sharing scheme using orbital angular momentum onto multiple spin states based on Fibonacci compression encoding. In our proposed scheme, we can represent the frequency of any secret message which is typically collection of bits encodings of text or integers as a bitstring using the base Fibonacci sequence, which is encoded multiple spin states for secret shares transmitted to participants. We demonstrate that Fibonacci compression encoding carries excellent properties that enable us to achieve more robust quantum secret sharing schemes with fewer number of photons.     

Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding

In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci-and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci-and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value.     

Universal Three-Party Quantum Secret Sharing Against Collective Noise

we present a robust and universal quantum secret sharing protocol with four-qubit decoherence-free (DF) states against collective noise. The transmission's safety is ensured by the nonorthogonality of the noiseless states traveling on the quantum channel. Although this scheme uses entangled states for encoding, only single-particle product measurements are required.     

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.     

Scheme for sharing classical information via tripartite entangled states

We investigate schemes for quantum secret sharing and quantum dense coding via tripartite entangled states. We present a scheme for sharing classical information via entanglement swapping using two tripartite entangled GHZ states. In order to throw light upon the security affairs of the quantum dense coding protocol, we also suggest a secure quantum dense coding scheme via W state by analogy with the theory of sharing information among involved users.     

Multiple Multi-Qubit Quantum States Sharing

A multiple multi-qubit quantum states sharing scheme is proposed,in which the dealer can share multiple multi-qubit quantum states among the participants through only one distribution and one recovery.The dealer encodes the secret quantum states into a special entangled state,and then distributes the particles of the entangled state to the participants.The participants perform the single-particle measurements on their particles,and can cooperate to recover the multiple multi-qubit quantum states.Compared to the existing schemes,our scheme is more efficient and more flexible in practice.     

可控量子秘密共享协议窃听检测虚警概率分析

对孙莹等提出的利用Greenberger-Horne-Zeilinger态实现的可控量子秘密共享协议Alice-Bob信道和Alice-Charlie信道窃听检测的虚警概率进行分析,指出该协议窃听检测虚警概率不为0的原因在于窃听检测测量基选择的随机性.然后,提出一种改进的利用Greenberger-HorneZeilinger态实现的可控量子秘密共享协议,以确定性的方式选择窃听检测的测量基.理论分析表明,改进的利用Greenberger-Horne-Zeilinger态实现的可控量子秘密共享协议不仅能够以原协议2倍的概率发现任何一个内部不可信方,从而具有更高的安全性,而且窃听检测虚警概率达到0.     

基于显微物镜的表面等离子体共振

对孙莹等提出的利用Greenberger-Horne-Zeilinger态实现的可控量子秘密共享协议Alice-Bob信道和Alice-Charlie信道窃听检测的虚警概率进行分析,指出该协议窃听检测虚警概率不为0的原因在于窃听检测测量基选择的随机性.然后,提出一种改进的利用Greenberger-Horne-Zeilinger态实现的可控量子秘密共享协议,以确定性的方式选择窃听检测的测量基.理论分析表明,改进的利用Greenberger-Horne-Zeilinger态实现的可控量子秘密共享协议不仅能够以原协议2倍的概率发现任何一个内部不可信方,从而具有更高的安全性,而且窃听检测虚警概率达到0.     

Quantum secret sharing without entanglement

After analysing the main quantum secret sharing protocol based on the entanglement states, we propose an idea to directly encode the qubit of quantum key distributions, and then present a quantum secret sharing scheme where only product states are employed. As entanglement, especially the inaccessible multi-entangled state, is not necessary in the present quantum secret sharing protocol, it may be more applicable when the number of the parties of secret sharing is large. Its theoretic efficiency is also doubled to approach 100%.     

Quantum secret sharing between m-party and n-party with six states

A quantum secret sharing scheme between an m-party group and an n-party group is proposed using three conjugate bases.A sequence of single photons,each of which is prepared in one of the six states,is used directly to encode classical information in the quantum secret sharing process.In this scheme,each of all m members in group 1 chooses randomly his/her own secret key individually and independently,and directly encodes his/her respective secret information on the states of single photons via unitary opera...     

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

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

Multiparty Quantum Secret Sharing of Quantum States Using Entanglement States

A multi-partite-controlled quantum secret sharing scheme using several non-orthogonal entanglement states is presented with unconditional security. In this scheme, the participants share the secret quantum state by exchanging the secret polarization angles of the disordered travel particles. The security of the secret quantum state is also guaranteed by the non-orthogonal multi-partite-controlled entanglement states, the participants＇ secret polarizations, and the disorder of the travelling particles. Moreover, the present scheme is secure against the particle-number splitting attack and the intercept-and-resend attack. It may be still secure even if the distributed quantum state is embedded in a not-so-weak coherent-state pulse.     

Multiparty Quantum Secret Sharing of Secure Direct Communication Using Teleportation

We present an (n,n) threshold quantum secret sharing scheme of secure direct communication using Greenberger-Horne-Zeilinger state and teleportation.After ensuring the security of the quantum channel,the sender encodes the secret message directly on a sequence of particle states and transmits it to the receivers by teleportation.The receivers can recover the secret message by combining their measurement results with the sender's result.If a perfect quantum channel is used,our scheme is completely secure because the transmitting particle sequence does not carry the secret message.We also show our scheme is secure for noise quantum channel.     

Dynamic(2, 3) Threshold Quantum Secret Sharing of Secure Direct Communication

In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.     

Multiparty Quantum Secret Sharing of Quantum States with Quantum Registers

A quantum secret sharing scheme is proposed by making use of quantum registers. In the proposed scheme, secret message state is encoded into multipartite entangled states. Several identical multi-particle entanglement states are generated and each particle of the entanglement state is filled in different quantum registers which act as shares of the secret message. Two modes, i.e. the detecting mode and the message mode, are employed so that the eavesdropping can be detected easily and the secret message may be recovered. The security analysis shows that the proposed scheme is secure against eavesdropping of eavesdropper and cheating of participants.     

Multiparty secret sharing of quantum information using and identifying Bell states

In this paper, only Bell states are employed and needed to be identified to realize the multiparty secret sharing of quantum information, where the secret is an arbitrary unknown quantum state in a qubit. In our multiparty quantum information secret sharing (QISS) scheme, no subset of all the quantum information receivers is sufficient to reconstruct the unknown state in a qubit but the entire is. The present multiparty QISS scheme is more feasible with present-day technique.     

Graph State-Based Quantum Secret Sharing with the Chinese Remainder Theorem

Quantum secret sharing (QSS) is a significant quantum cryptography technology in the literature. Dividing an initial secret into several sub-secrets which are then transferred to other legal participants so that it can be securely recovered in a collaboration fashion. In this paper, we develop a quantum route selection based on the encoded quantum graph state, thus enabling the practical QSS scheme in the small-scale complex quantum network. Legal participants are conveniently designated with the quantum route selection using the entanglement of the encoded graph states. Each participant holds a vertex of the graph state so that legal participants are selected through performing operations on specific vertices. The Chinese remainder theorem (CRT) strengthens the security of the recovering process of the initial secret among the legal participants. The security is ensured by the entanglement of the encoded graph states that are cooperatively prepared and shared by legal users beforehand with the sub-secrets embedded in the CRT over finite fields.     

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.     

Comment on: “Efficient high-capacity quantum secret sharing with two-photon entanglement” [Phys. Lett. A 372 (2008) 1957]

In a recent Letter [F.G. Deng, X.H. Li, H.Y. Zhou, Phys. Lett. A 372 (2008) 1957], an efficient high-capacity quantum secret sharing scheme was proposed. However, in this comment, it is shown that the protocol does not complete the task of secret sharing well when the message sender uses the nonorthogonal entangled states as the quantum information carriers. Finally a feasible improvement of this quantum secret sharing protocol is proposed.     

High-capacity three-party quantum secret sharing with superdense coding

This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Lett. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein--Podolsky--Rosen pairs in d-dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 2lbd bits of information, and almost all the pairs can be used for carrying useful information.