Here we described a protocol by which one can broadcast GHZ-type states secretly. We have done this with the help of a cloning machine followed by subsequent measurements. We also made a comparative study of the amount of residual tangle present in these entangled states, obtained as outputs of the measurements.
In this work we investigate the problem of secretly broadcasting five qubit entangled state between three different partners We implement the protocol described in ref [16] on three particle W-state shared by three distant partners Alice,Bob and Charlie. The problem is interesting in the sense it is the first attempt to broadcast five qubit entangled state between three parties.
In this work we describe a protocol by which one can secretly broadcast W-type state among three distant partners. This work is interesting in the sense that we introduce a new kind of local cloning operation to generate two W- type states between these partners from a W-type state initially shared by them.
We introduce entanglement measures to describe entanglement in a three-particle system and apply it to studying broadcasting of entanglement in three-particle GHZ state. We show that entanglement of three-qubit GHZ state can be partially broadcasted with the help of local or non-local copying processes. It is found that non-local cloning is much more efficient than local cloning for the broadcasting of entanglement.
A broadcasting multiple blind signature scheme based on quantum GHZ entanglement has been presented recently by Tian et al. It is said that the scheme's unconditional security is guaranteed by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. In this paper, we prove that each signatory can get the signed message just by an intercept-resend attack. Then, we show there still exists some participant attacks and external attacks. Specifically, we verify the message sender Alice can impersonate each signatory to sign the message at will, and so is the signatur…
We present a setup for quantum secret sharing using pseudo-GHZ states based on energy-time entanglement. In opposition to true GHZ states, our states do not enable GHZ-type tests of nonlocality, however, they bare the same quantum correlations. The relatively high coincidence count rates found in our setup enable for the first time an application of a quantum communication protocoll based on more than two qubits.
In this note, we study some properties of the GHZ state. First, we present a quantum secret sharing scheme in which the participants require only classical channels in order to reconstruct the secret; our protocol is significantly more efficient than the trivial usage of teleportation. Second, we show that the classical simulation of an n-party GHZ state requires at least n log n - 2n bits of communication. Finally, we present a problem simpler than the complete simulation of the multi-party GHZ state, that could lead to a no-go theorem for GHZ state simulation.
We show a potential eavesdropper can eavesdrop whole secret information when the legitimate users use secure carrier to encode and decode classical information repeatedly in the protocol [proposed in Bagherinezhad S and Karimipour V 2003 Phys. Rev. A \textbf{67} 044302]. Then we present a revised quantum secret sharing protocol by using Greenberger-Horne-Zeilinger state as secure carrier. Our protocol can resist Eve's attack.
Recently, a broadcasting multiple blind signature scheme based on quantum teleportation has been proposed for the first time. It is claimed to have unconditional security and properties of quantum multiple signature and quantum blind signature. In this paper, we analyze the security of the protocol and show that the signatory Ui can learn the signed message m by a single particle measurement and the signed message m can be modified at random by anyone according to the scheme. Furthermore, there are some participant attacks and external attacks existing in the scheme. Finally we present an impr…
We propose a way for transferring Greenberger-Horne-Zeilinger (GHZ) entangled states from $n$ qubits in one cavity onto another $n$ qubits in the other cavity. It is shown that $n$-qubit GHZ states $α\left\vert 00...0\right\rangle +β\left\vert 11...1\right\rangle $ with arbitrary degree of entanglement can be transferred deterministically. Both of the GHZ state transfer and the operation time are not dependent on the number of qubits, and there is no need of measurement. This proposal is quite general and can be applied to accomplish the same task for a wide range of physical qubits. Furthermo…
We introduce a protocol for quantum secret sharing based on reusable entangled states. The entangled state between the sender and the receiver acts only as a carrier to which data bits are entangled by the sender and disentangled from it by the receivers, all by local actions of simple gates. We also show that the interception by Eve or the cheating of one of the receivers introduces a quantum bit error rate (QBER) larger than 25 percent which can be detected by comparing a subsequence of the bits.
We present a deterministic secure direct communication scheme via entanglement swapping, where a set of ordered maximally entangled three-particle states (GHZ states), initially shared by three spatially separated parties, Alice, Bob and Charlie, functions as a quantum information channel. After ensuring the safety of the quantum channel, Alice and Bob apply a series local operations on their respective particles according to the tripartite stipulation and the secret message they both want to send to Charlie. By three Alice, Bob and Charlie's Bell measurement results, Charlie is able to infer …
A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her $M$ agents first share a sequence of ($M$+1)-particle Greenberger--Horne--Zeilinger (GHZ) states that only Alice knows which state each ($M$+1)-particle quantum system is in. Each agent exploits a controlled-not (CNot) gate to encrypt the travelling particle by using the particle in the GHZ state as the control qubit. The boss Alice decrypts the travelling particle with a CNot gate after performing a $σ_x$ operation on her particle in the GHZ state or not. After the GHZ states (the quantum key…
Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GHZ states. In the quantum case the presence of an eavesdropper will introduce errors so that his presence can be detected. We also show how GHZ states can be used to split quantum information into two parts so that both parts are necessary to reconstruct the original qubit.
Quantum Key Agreement (QKA) signifies that two or more participants together generate a key and QKA has to satisfy the following conditions: 1 Every participant can change the key and the key is not decided by any participant individually. 2 Only participants can know the key; nonparticipants cannot get the key through illegal means. Because of the condition 1 of participating together, it makes transport inefficient in the current mainstream protocols. They use unicast to exchange messages one by one, so it will considerably limit transmission efficiency and increase cost time spent. This stu…
In this paper, a three party controlled quantum secure direct communication protocol based on GHZ like state is proposed. In this scheme, the receiver can obtain the sender s two secret bits under the permission of the controller. By using entanglement swapping, no qubits carrying secret messages are transmitted. Therefore, if the perfect quantum channel is used, the protocol is completely secure. The motivation behind utilizing GHZ like state as a quantum channel is that if a qubit is lost in the GHZ like state the other two qubits are still entangled. The proposed protocol improves the effic…
We present two schemes for multiparty quantum remote secret conference in which each legitimate conferee can read out securely the secret message announced by another one, but a vicious eavesdropper can get nothing about it. The first one is based on the same key shared efficiently and securely by all the parties with Greenberger-Horne-Zeilinger (GHZ) states, and each conferee sends his secret message to the others with one-time pad crypto-system. The other one is based on quantum encryption with a quantum key, a sequence of GHZ states shared among all the conferees and used repeatedly after c…
A large payload bidirectional quantum secure direct communication (BQSDC) protocol without information leakage is proposed, which is based on entanglement swapping between any two GHZ states. Two remote authorized parties, Alice and Bob, can safely exchange their individual secret messages without worrying about the information leakage problem. Our protocol uses a shared secret GHZ state to overcome the information leakage problem. The shared secret GHZ state plays two roles in the bidirectional communication process: on one hand, it lets Bob know the prepared initial state; on the other hand,…
A quantum steganography protocol with large payload is proposed, based on dense coding and entanglement swapping of GHZ states. Its super quantum channel is formed by building up the hidden channel within the original quantum secure direct communication (QSDC) scheme. Based on the original QSDC, secrets messages are transmitted by integrating dense coding of GHZ states and entanglement swapping of GHZ states. Its capacity of super quantum channel achieves six bits per round covert communication, much higher than the previous quantum steganography protocols. Its imperceptibility is good, since …
The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret. The protocol also allows for security against malicious attacks by an adver…
In a recent paper [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], a quantum secret sharing protocol based on reusable GHZ states was proposed. However, in this Comment, it is shown that this protocol is insecure if Eve employs a special strategy to attack.
Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper we propose two semi-quantum secret sharing protocols using maximally entangled GHZ-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one …
In this paper, we investigate a novel $(2,2)$-threshold scheme and then generalize this to a $(n,n)$-threshold scheme for quantum secret sharing (QSS) which makes use of the fundamentals of Analytic Geometry. The dealer aptly selects GHZ states related to the coefficients which determine straight lines on a two-dimension plane. Then by computing each two of the lines intercept or not, we obtain a judging matrix whose rank can be used to determine the secret stored in entangled bits. Based on the database technology, authorized participants access to the database to obtain the secret informatio…
In a recent paper [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], a quantum secret sharing protocol based on reusable GHZ states was proposed. However, in this comment, it is shown that this protocol is insecure because a cheater can gain all the secret bits before sharing, while introducing one data bit error at most in the whole communication, which makes the cheater avoid the detection by the communication parities.
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its reconstruction require the collaboration of the participating parties. In the proposed scheme the parties solve the problem by a sequential communication of a single qubit. Moreover we show that our scheme is equivalent to the use of a multiparty entangled GHZ state but easier to realize and better scalable in practical applications.
Quantum privacy comparison(QPC) plays an important role in secret ballot elections, private auctions and so on. To date, many multi-party QPC(MQPC) protocols have been proposed to compare the equality of $k(k\geq 3)$ participants. However, there are few examples of MQPC used to compare the sizes or values of their privacies. In this paper, we propose a MQPC protocol by which any $k(k\geq 3)$ participants can compare the sizes of their privacies with executing the protocol just once. The proposed MQPC protocol takes the $d-level$ GHZ states as quantum resources, and a semi-honest $TP$ is introd…
Quantum secret sharing is a way to share secret messages among the clients in a group with complete security. For the first time, Hillery et al. (Phys Rev A 59:1829, 1999) proposed the quantum version of the classical secret sharing protocol using GHZ states. Here, we implement the above quantum secret sharing protocol in 'IBM Q 5 Tenerife' quantum processor and compare the experimentally obtained results with the theoretically predicted ones. Further, a new quantum binary voting protocol is proposed and implemented in the 14-qubit 'IBM Q 14 Melbourne' quantum processor. The results are analyz…
Based on the two-step protocol [Phys. Rev. A68(03)042317], we propose a $(n,n)$-threshold multiparty quantum secret sharing protocol of secure direct communication. In our protocol only all the sharers collaborate can the sender's secure direct communication message be extracted. We show a variant version of this protocol based on the variant two-step protocol. This variant version can considerably reduce the realization difficulty in experiment. In contrast to the use of multi-particle GHZ states in the case that the sharer number is larger than 3, the use and identification of Bell states ar…
We present a quantum dialogue protocol by using the Greenberger-Horne-Zeilinger (GHZ) state. In this paper, we point out that the `quantum dialogue' communication scheme recently introduced by Nguyen can be eavesdropped on under an intercept-and-resend attack. We also give a revised control mode to detect this attack. Hence, within the present version two users can exchange their secret messages securely and simultaneously, and the efficiency of information transmission can be successfully increased.
Secure cryptographic protocols are indispensable for modern communication systems. It is realized through an encryption process in cryptography. In quantum cryptography, Quantum Key Distribution (QKD) is a widely popular quantum communication scheme that enables two parties to establish a shared secret key that can be used to encrypt and decrypt messages. But security loopholes still exist in this cryptographic protocol, as an eavesdropper can in principle still intercept all the ciphertext to perform cryptanalysis and the key may get leaked to the eavesdropper, although it happens very rarely…
We propose two Quantum Direct Communication (QDC) protocols with user authentication. Users can identify each other by checking the correlation of Greenberger-Horne-Zeilinger (GHZ) states. Alice can directly send a secret message to Bob using the remaining GHZ states after authentication. Our second QDC protocol can be used even though there is no quantum link between Alice and Bob. The security of the transmitted message is guaranteed by properties of entanglement of GHZ states.
In this article we present a general security strategy for quantum secret sharing (QSS) protocols based on the HBB scheme presented by Hillery, Bužek and Berthiaume [Phys. Rev A \textbf{59}, 1829 (1999)]. We focus on a generalization of the HBB protocol to $n$ communication parties thus including $n$-partite GHZ states. We show that the multipartite version of the HBB scheme is insecure in certain settings and impractical when going to large $n$. To provide security for such QSS schemes in general we use the framework presented by some of the authors [M. Huber, F. Minert, A. Gabriel, B. C. Hie…
An authentic digital signature scheme based on the correlation of Greenberger-Horne-Zeilinger (GHZ) states was presented. In this scheme, by performing a local unitary operation on the third particles of each GHZ triplet, Alice can encode message M and get its signature S. Bob performs CNOT operation on the combined GHZ triplets can recovery the message M and directly authenticates Alice's signature S. Our scheme was designed to use quantum secret key to guaranteed unconditional security, as well as use quantum fingerprinting to avoid trick attacks and reduce communication complexity.
We present a generalized Greenberger-Horne-Zeilinger (GHZ) theorem, which involves more than two local measurement settings for some parties, and cannot be reduced to one with less settings. Our results hold for an odd number of parties. We use a set of observables, which are incompatible but share a common eigenstate, here a GHZ state. Such observables are called concurrent. The idea is illustrated with an example of a three-qutrit system and then generalized to systems of higher dimensions, and more parties. The GHZ paradoxes can lead to, e.g., secret sharing protocols.
Quantum Conference Key Agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key. While bipartite quantum key distribution protocols are also useful in the context of CKA, multipartite protocols allow for a more efficient generation of the necessary correlations and are therefore viewed favorably in the context of quantum networks. In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that do not only want to keep their shared key secret but also protect their own identity, e.g. in the context of whis…
The distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks, ranging from extending the baseline of telescopes to secret sharing. They also play an important role in error-correction architectures for distributed quantum computation, where Bell pairs can be leveraged to create an entangled network of quantum computers. We investigate the creation and distillation of GHZ states out of non-perfect Bell pairs over quantum networks. In particular, we introduce a heuristic dynamic programming algorithm to optimize over a large class …
We present a quantum key distribution system with a 2.5 GHz repetition rate using a three-state time-bin protocol combined with a one-decoy approach. Taking advantage of superconducting single-photon detectors optimized for quantum key distribution and ultra low-loss fiber, we can distribute secret keys at a maximum distance of 421 km and obtain secret key rates of 6.5 bps over 405 km.
Distribution and distillation of entanglement over quantum networks is a basic task for Quantum Internet applications. A fundamental question is then to determine the ultimate performance of entanglement distribution over a given network. Although this question has been extensively explored for bipartite entanglement-distribution scenarios, less is known about multipartite entanglement distribution. Here we establish the fundamental limit of distributing multipartite entanglement, in the form of GHZ states, over a quantum network. In particular, we determine the multipartite entanglement distr…
We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on multi-partite G…
We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph states. We then apply our distillation schemes to the tri-partite case for three cryptographic tasks--namely, (a) conference key agreement, (b) quantum sharing of classical secrets and (c) third-man cryptography. Moreover, we construct ``prepare-and-measure'' protocols for the above three cryptographic tasks which can be implemented with the generation of only a …
Multiparty quantum communication provides delightful applications including quantum cryptographic communication and quantum secret sharing. Measurement-Device-Independent (MDI) quantum communication based on the Greenberg-Horne-Zeilinger (GHZ) state measurement provides a practical way to implement multiparty quantum communication. With the standard spatially localized GHZ state measurement, however, information can be imbalanced among the communication parties that can cause significant problems in multiparty cryptographic communication. Here, we propose an equitable multiparty quantum commun…
Agile cryptography allows for a resource-efficient swap of a cryptographic core in case the security of an underlying classical cryptographic algorithm becomes compromised. Conversely, versatile cryptography allows the user to switch the cryptographic task without requiring any knowledge of its inner workings. In this paper, we suggest how these related principles can be applied to the field of quantum cryptography by explicitly demonstrating two quantum cryptographic protocols, quantum digital signatures (QDS) and quantum secret sharing (QSS), on the same hardware sender and receiver platform…
Intrinsic entanglement (IE) is a quantity which aims at quantifying bipartite entanglement carried by a quantum state as an optimal amount of the intrinsic information that can be extracted from the state by measurement. We investigate in detail the properties of a Gaussian version of IE, the so-called Gaussian intrinsic entanglement (GIE). We show explicitly how GIE simplifies to the mutual information of a distribution of outcomes of measurements on a conditional state obtained by a measurement on a purifying subsystem of the analyzed state, which is first minimized over all measurements on …
We propose a protocol for multipartite secret sharing of quantum information through an \textit{amplitude damping} quantum channel. This network is, for example, of two organizations communicating with their own employees connected via classical channels locally. We consider a GHZ state distributed among four members in an asymmetric fashion where the members of a sub-party collaborate to decode the received information at their end. The target is to send two bits of information in \textit{one execution} of the protocol. Firstly, we consider an ideal channel and observe that our protocol enabl…
Consider a situation in which a quantum system is secretly prepared in a state chosen from the known set of states. We present a principle that gives a definite distinction between the operations that preserve the states of the system and those that disturb the states. The principle is derived by alternately applying a fundamental property of classical signals and a fundamental property of quantum ones. The principle can be cast into a simple form by using a decomposition of the relevant Hilbert space, which is uniquely determined by the set of possible states. The decomposition implies the cl…