We study the problem of secret key distillation from bipartite states in the scenario where Alice and Bob can only perform measurements at the single-copy level and classically process the obtained outcomes. Even with these limitations, secret bits can be asymptotically distilled by the honest parties from any two-qubit entangled state, under any individual attack. Our results point out a complete equivalence between two-qubit entanglement and secure key distribution: a key can be established through a one-qubit channel if and only if it allows to distribute entanglement. These results can be generalized to higher dimension for all those states that are one-copy distillable.
This paper considers the use an entanglement breaking channel in the construction of a secure bit-commitment protocol. It is shown that this can be done via a depolarizing quantum channel.
An unconditionally secure quantum cion tossing protocol for two remote participants via entangled swapping is presented. The security of this protocol is guaranteed by the nonlocal property of quantum entanglement and the classical complexity.
In this paper, we present a quantum secure multi-party summation protocol, which allows multiple mutually distrustful parties to securely compute the summation of their secret data. In the presented protocol, a semitrusted third party is introduced to help multiple parties to achieve this secure task. Besides, the entanglement swapping of $d$-level cat states and Bell states is employed to securely transmit message between each party and the semitrusted third party. At last, its security against some common attacks is analyzed, which shows that the presented protocol is secure in theory.
We leverage spectral assets of entanglement and spatial switching to realize a flexible distribution map for cloud-to-edge and edge-to-edge quantum pipes that seed IT-secure primitives. Dynamic bandwidth allocation and co-existence with classical control are demonstrated.
Extending the eavesdropping strategy devised by Zhang, Li and Guo [Phys. Rev. A 63, 036301 (2001)], we show that the multiparty quantum communication protocol based on entanglement swapping, which was proposed by Cabello [quant-ph/0009025], is not secure. We modify the protocol so that entanglement swapping can secure multiparty quantum communication, such as multiparty quantum key distribution and quantum secret sharing of classical information, and show that the modified protocol is secure against the Zhang-Li-Guo's strategy for eavesdropping as well as the basic intercept-resend attack.
We show a deterministic secure direct communication protocol using single qubit in mixed state. The security of this protocol is based on the security proof of BB84 protocol. It can be realized with current technologies.
We report two key distribution schemes achieved by swapping quantum entanglement. Using two Bell states, two bits of secret key can be shared between two distant parties that play symmetric and equal roles. We also address eavesdropping attacks against the schemes.
In this paper, a bidirectional quantum teleportation protocol based on Einstein-Podolsky-Rosen (EPR) pairs and entanglement swapping is proposed. In this scheme, two users can simultaneously transmit an unknown single-qubit state to each other. The implementation of the proposed scheme is easier in experiment as compared to previous work. By utilizing this bidirectional quantum teleportation protocol, a bidirectional quantum secure direct communication scheme without carrying secret message is presented. Therefore, in the case of using perfect quantum channel, the protocol is completely secure…
We explore the use of the resource of intra-particle entanglement for secure quantum key distribution in the device-independent scenario. By virtue of the local nature of such entanglement, Bell tests must be implemented locally, which leads to a natural decoupling of device errors from channel errors. We consider a side channel attack on the sender's state preparation device, for which the intra-particle-entanglement based scheme is shown to be more secure than the one that uses separable states. Of practical relevance is the fact that such entanglement can be easily generated using linear op…
I consider the use of entanglement between two parties to enable one to authenticate her identity to another over a quantum communication channel. Exploiting the phenomenon of entanglement-catalyzed transformations between pure states gives a potentially reusable entangled identification token. In analyzing this, I consider the independently interesting problem of the best possible approximation to a given pure entangled state realizable using local actions and classical communication by parties sharing a different entangled state.
It is shown how the evidence state space in quantum bit commitment may be made to depend on the bit value 0 or 1 with split entangled pairs. As a consequence, one can obtain a protocol that is perfectly concealing, but is also $ε$-binding because the bit-value dependent evidence space prevents the committing party from cheating by means of a local transformation that is independent of the part of evidence state space that has never been in his possession.
We demonstrate that a necessary precondition for unconditionally secure quantum key distribution is that sender and receiver can use the available measurement results to prove the presence of entanglement in a quantum state that is effectively distributed between them. One can thus systematically search for entanglement using the class of entanglement witness operators that can be constructed from the observed data. We apply such analysis to two well-known quantum key distribution protocols, namely the 4-state protocol and the 6-state protocol. As a special case, we show that, for some asymmet…
We characterize the set of shared quantum states which contain a cryptographically private key. This allows us to recast the theory of privacy as a paradigm closely related to that used in entanglement manipulation. It is shown that one can distill an arbitrarily secure key from bound entangled states. There are also states which have less distillable private key than the entanglement cost of the state. In general the amount of distillable key is bounded from above by the relative entropy of entanglement. Relationships between distillability and distinguishability are found for a class of stat…
We propose a protocol for deterministic communication that does not make use of entanglement. It exploits nonorthogonal states in a two-way quantum channel attaining significant improvement of security and efficiency over already known cryptographic protocols. The presented scheme, being deterministic, can be devoted to direct communication as well as to key distribution, and its experimental realization is feasible with present day technology.
A novel communication protocol based on an entangled pair of qubits is presented, allowing secure direct communication from one party to another without the need for a shared secret key. Since the information is transferred in a deterministic manner, no qubits have to be discarded and every qubit carries message information. The security of the transfer against active and passive eavesdropping attacks is provided. The detection rate of active attacks is at least 25%. The protocol works with a quantum efficiency of 1 bit per qubit transmitted.
A novel secure communication protocol is presented, based on an entangled pair of qubits and allowing asymptotically secure key distribution and quasi-secure direct communication. Since the information is transferred in a deterministic manner, no qubits have to be discarded. The transmission of information is instantaneous, i.e. the information can be decoded during the transmission. The security against arbitrary eavesdropping attacks is provided. In case of eavesdropping attacks with full information gain, the detection rate is 50% per control transmission. The experimental realization of th…
In a recent comment, it has been shown that in a quantum secret sharing protocol proposed in [S. Bagherinezhad, V. Karimipour, Phys. Rev. {\bf A}, 67, 044302, (2003)], one of the receivers can cheat by splitting the entanglement of the carrier and intercepting the secret, without being detected. In this reply we show that a simple modification of the protocol prevents the receivers from this kind of cheating.
Quantum metrology and quantum communications are typically considered as distinct applications in the broader portfolio of quantum technologies. However, there are cases where we might want to combine the two and recent proposals have shown how this might be achieved in entanglement-based systems. Here we present an entanglement-free alternative that has advantages in terms of simplicity and practicality, requiring only individual qubits to be transmitted. We demonstrate the performance of the scheme in both the low and high data limits, showing quantum advantages both in terms of measurement …
We present a quantum secure direct communication protocol and a multiparty quantum secret sharing protocol based on Einstein-Podolsky-Rosen pairs and entanglement swapping. The present quantum secure direct communication protocol makes use of the ideal of block transmission. We also point out that the sender can encode his or her secret message without ensuring the security of the quantum channel firstly. In the multiparty quantum secret sharing protocol, the communication parties adopt checking mode or encoding mode with a certain probability. It is not necessary for the protocol to perform l…
Superdense coding uses entanglement as a resource to communicate classical information securely through quantum channels. A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob, but neither absolute nor genuine multipartite entanglement is required. Unlike the previous schemes, which can transmit either even or odd bits of information, we have demonstrated a generalized dense coding protocol using the genuine multipartite entangled GHZ state to send arbitrary informat…
It is proven that recently introduced states with perfectly secure bits of cryptographic key (private states representing secure bit) [K. Horodecki et al., Phys. Rev. Lett. 94, 160502 (2005)] as well as its multipartite and higher dimension generalizations always represent distillable entanglement. The corresponding lower bounds on distillable entanglement are provided. We also present a simple alternative proof that for any bipartite quantum state entanglement cost is an upper bound on distillable cryptographic key in bipartite scenario.
We show the equivalence of two approaches to the design of entanglement distillation protocols. The first approach is based on local unitary operations that yield permutations of tensor products of Bell states. The second approach is based on stabilizer codes.
In this paper, a three-party secure semiquantum summation protocol, which can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants, is constructed by only using single qubits as the initial quantum resource. This protocol needs none of quantum entanglement swapping, the unitary operation or a pre-shared private key. This protocol only requires the quantum participant to perform the Z basis measurements, the X basis measurements and the Bell basis measurements. Compared with the existing only semiquantum summation protocol (Int J Theor …
We present a quantum secure direct communication scheme achieved by swapping quantum entanglement. In this scheme a set of ordered Einstein-Podolsky-Rosen (EPR) pairs is used as a quantum information channel for sending secret messages directly. After insuring the safety of the quantum channel, the sender Alice encodes the secret messages directly by applying a series local operations on her particles sequence according to their stipulation. Using three EPR pairs, three bits of secret classical information can be faithfully transmitted from Alice to remote Bob without revealing any information…
In single-qubit quantum secret sharing, a secret is shared between N parties via manipulation and measurement of one qubit at a time. Each qubit is sent to all N parties in sequence; the secret is encoded in the first participant's preparation of the qubit state and the subsequent participants' choices of state rotation or measurement basis. We present a protocol for single-qubit quantum secret sharing using polarization entanglement of photon pairs produced in type-I spontaneous parametric downconversion. We investigate the protocol's security against eavesdropping attack under common experim…
We present a security proof for establishing private entanglement by means of recurrence-type entanglement distillation protocols over noisy quantum channels. We consider protocols where the local devices are imperfect, and show that nonetheless a confidential quantum channel can be established, and used to e.g. perform distributed quantum computation in a secure manner. While our results are not fully device independent (which we argue to be unachievable in settings with quantum outputs), our proof holds for arbitrary channel noise and noisy local operations, and even in the case where the ea…
With an easily applicable criterion based on permutation symmetries of (identically prepared) replicas of quantum states we identify distinct entanglement classes in high-dimensional multi- partite systems. The different symmetry properties of inequivalent states provide a rather intuitive picture of the otherwise very abstract classification of many-body entangled states.
We analyse the relationship between the full additivity of the entanglement cost and its full monotonicity under local operations and classical communication. We show that the two properties are equivalent for the entanglement cost. The proof works for the regularization of any convex, subadditive, and asymptotically continuous entanglement monotone, and hence also applies to the asymptotic relative entropy of entanglement.
Entanglement plays a crucial role in the security of quantum key distribution. A secret key can only be obtained by two parties if there exists a corresponding entanglement-based description of the protocol in which entanglement is witnessed, as shown by Curty et al (2004). Here we investigate the role of entanglement for the generalization of quantum key distribution to the multipartite scenario, namely conference key agreement. In particular, we ask whether the strongest form of multipartite entanglement, namely genuine multipartite entanglement, is necessary to establish a conference key. W…
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 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 …
Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully-fledged quantum computer, in such a way that the server cannot learn anything about client's input, output, and program. If the client interacts with only a single server, the client has to have some minimum quantum power, such as the ability of emitting randomly rotated single-qubit states or the ability of measuring states. If the client interacts with two servers who share Bell pa…
Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have some minimum quantum ability, while the double-server BQC protocol makes the client's device completely classical, resorting to the pure and clean Bell-state shared by two servers. In this paper, we provide a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol. This protocol can obtain the pur…
To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.
A deterministic direct quantum communication protocol by using swapping quantum entanglement and local unitary operations is proposed in this paper. A set of ordered EPR pairs in one of the four Bell states is used. For each pair, each of the two legitimate users owns a photon of the entangled pair via quantum channel. The pairs are divided into two types of group, i.e., the checking groups and the encoding-decoding groups. In the checking groups, taking advantage of the swapping quantum entanglement and Alice's (the message sender's) public announcement, the eavesdropping can be detected prov…
We examine the powers of entanglement-assisted transformation and multiple-copy entanglement transformation. First, we find a sufficient condition of when a given catalyst is useful in producing another specific target state. As an application of this condition, for any non-maximally entangled bipartite pure state and any integer $n$ not less than 4, we are able to explicitly construct a set of $n\times n$ quantum states which can be produced by using the given state as a catalyst. Second, we prove that for any positive integer $k$, entanglement-assisted transformation with $k\times k$-dimensi…
The ``impossibility proof'' on unconditionally secure quantum bit commitment is examined. It is shown that the possibility of juxtaposing quantum and classical randomness has not been properly taken into account. A specific protocol that beats entanglement cheating with entanglement is proven to be unconditionally secure.
The necessary and sufficient conditions for the equivalence of arbitrary n-qubit pure quantum states under Local Unitary (LU) operations derived in [B. Kraus Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two n-qubit states (with n>2 arbitrary) which have the properties that all the entropies of any subsystem coincide, however, the s…
High-dimensional quantum key distribution (HDQKD) offers the possibility of high secure-key rate with high photon-information efficiency. We consider HDQKD based on the time-energy entanglement produced by spontaneous parametric downconversion, and show that it is secure against collective attacks. Its security rests upon visibility data -- obtained from Franson and conjugate-Franson interferometers -- that probe photon-pair frequency correlations and arrival-time correlations. From these measurements an upper bound can be established on the eavesdropper's Holevo information by translating the…
A multipartner secure direct communication protocol is presented, using quantum nonlocality. Security of this protocol is based on `High fidelity implies low entropy'. When the entanglement was successfully distributed, anyone of the multipartner can send message secretly by using local operation and reliable public channel. Since message transfered only by using local operation and public channel after entanglement successfully distributed, so this protocol can protect the communication against destroying-travel-qubit-type attack.
We present a protocol for sending a message over a quantum channel with different layers of security that will prevent an eavesdropper from deciphering the message without being detected. The protocol has two versions where the bits are encoded in either pairs of entangled photons or separate photons. Unlike many other protocols, it requires a one-way, rather than a two-way, quantum channel and does not require a quantum memor. A quantum key is used to encrypt the message and both the key and the message are sent over the quantum channle with the same quantum encoding technique. The key is sen…
This paper introduces a new quantum protocol for secure direct communication. This protocol is based on Entanglement and Super-Dense coding. In this paper we present some basic definitions of entanglement in quantum mechanics, present how to use the maximally entangled states known as Bell States, and super dense coding technique to achieve secure direct message communication. Finally, we will apply some error models that could affect the transmission of the quantum data on the quantum channels, and how to treat these errors and acquire a safe transmission of the data.
In this paper, a novel controlled bidirectional quantum secure direct communication protocol (CBQSDC) is proposed. In this scheme, both users can transmit their secret messages directly and simultaneously under the permission of the controller. The proposed method use feature of entanglement swapping which is led to more efficiency (lowest number of quantum resources (EPR pairs)), security and the lowest number of security checking steps. Also, a generalization of the protocol is explained and a protocol of CBQSDC-based network is presented.
"Quantum conversation" is a way in which two parties can communicate classical information with each other using entanglement as a shared resource. We present this scheme using a multipartite entangled state after describing its generation through appropriate circuit diagrams. We make use of a discrimination scheme which allows one to perform a measurement on the system without destroying its entanglement. We later prove that this scheme is secure in a noiseless and a lossless quantum channel.
We study the interconversion of multipartite symmetric $N$-qubit states under stochastic local operations and classical communication (SLOCC). We demonstrate that if two symmetric states can be connected with a nonsymmetric invertible local operation (ILO), then they belong necessarily to the separable, W, or GHZ entanglement class, establishing a practical method of discriminating subsets of entanglement classes. Furthermore, we prove that there always exists a symmetric ILO connecting any pair of symmetric $N$-qubit states equivalent under SLOCC, simplifying the requirements for experimental…
This article describes a quantum bit commitment protocol, QBC1, based on entanglement destruction via forced measurements and proves its unconditional security.
We present an one-time-pad key communication protocol that allows secure direct communication with entanglement. Alice can send message to Bob in a deterministic manner by using local measurements and public communication. The theoretical efficiency of this protocol is double compared with BB84 protocol. We show this protocol is unconditional secure under arbitrary quantum attack. And we discuss that this protocol can be perfectly implemented with current technologies.
We present a quantum secure direct communication(QSDC) scheme as an extension for a proposed supervised secure entanglement sharing protocol. Starting with a quick review on the supervised entanglement sharing protocol -- the "Wuhan" protocol [Y. Li and Y. Liu, arXiv:0709.1449v2], we primarily focus on its further extend using for a QSDC task, in which the communication attendant Alice encodes the secret message directly onto a sequence of 2-level particles which then can be faithfully teleported to Bob using the shared maximal entanglement states obtained by the previous "Wuhan" protocol. We …
Based on quantum entanglement, an all-or-nothing oblivious transfer protocol is proposed and is proven to be secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. More intriguingly, this OT protocol does not belong to a class of protocols denied by the Lo's no-go theorem of one-sided two-party secure computation, and thus its security can be achieved.
In this article, we discuss the optimality of basis transformations as a security measure for quantum key distribution protocols based on entanglement swapping. To estimate the security, we focus on the information an adversary obtains on the raw key bits from a generic version of a collective attack strategy. In the scenario described in this article, the application of general basis transformations serving as a counter measure by one or both legitimate parties is analyzed. In this context, we show that the angles, which describe these basis transformations can be optimized compared to the ap…
We present a supervised secure entanglement sharing protocol via tripartite W states for faithful quantum teleportation. By guaranteeing a secure entanglement distribution in the charge of a third believed supervisor, quantum information of an unknown state of a 2-level particle can be faithfully teleported from the sender to the remote receiver via the Bell states distilled from the tripartite W states. We emphasize that reliable teleportation after our protocol between two communication parties depends on the agreement of the supervisor to cooperate via taking the W states as both the quantu…
We investigate the existence of secure bit commitment protocols in the convex framework for probabilistic theories. The framework makes only minimal assumptions, and can be used to formalize quantum theory, classical probability theory, and a host of other possibilities. We prove that in all such theories that are locally non-classical but do not have entanglement, there exists a bit commitment protocol that is exponentially secure in the number of systems used.
A new quantum communication scheme is introduced which is the quantum realization of the classical Kish-Sethuraman (KS) cipher. First the message is bounced back with additional encryption by the Receiver and the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. We show that the rotation of the polarization is an operator which satisfies the conditions required for the KS encryption operators provided single photons are communicated. The new method is not only simple…
We report experimental generation of a noisy entangled four-photon state that exhibits a separation between the secure key contents and distillable entanglement, a hallmark feature of the recently established quantum theory of private states. The privacy analysis, based on the full tomographic reconstruction of the prepared state, is utilized in a proof-of-principle key generation. The inferiority of distillation-based strategies to extract the key is exposed by an implementation of an entanglement distillation protocol for the produced state.
Quantum secure direct communication (QSDC) can directly transmit secrete messages through quantum channel. Device-independent (DI) QSDC can guarantee the communication security relying only on the observation of the Bell inequality violation, but not on any detailed description or trust of the inner workings of users' devices. In the paper, we propose a DI-QSDC protocol with practical high-efficient single photon sources. The communication parties construct the entanglement channel from single photons by adopting the heralded architecture, which makes the message leakage rate independent of th…
Many quantum key distribution (QKD) implementations using a free space transmission path are restricted to operation at night time in order to distinguish the signal photons used for a secure key establishment from background light. Here, we present a lean entanglement-based QKD system overcoming that imitation. By implementing spectral, spatial and temporal filtering techniques, we were able to establish a secure key continuously over several days under varying light and weather conditions.
