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

arXiv:0802.1811 · Physical Review A

Entanglement enhances security in quantum communication

Rafał Demkowicz-Dobrzański, Aditi Sen, Ujjwal Sen, Maciej Lewenstein

Published Jul 13, 2009• 29 citations
arXivHTMLPDF

Abstract

Secret sharing is a protocol in which a ``boss'' wants to send a classical message secretly to two ``subordinates,'' such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing---a parallel of the Csisz\'ar-K\"orner criterion in single-receiver classical cryptography.

DOI
10.1103/physreva.80.012311

Related papers

Quantum Secret Sharing Based on Entanglement Swapping and Local Operation

Qin Su-juan, Tailin Liu, Wen Qiao-yan

To improve the efficiency of quantum secret sharing, a protocol share the message directly among the users was proposed. The scheme made full use of entanglement swapping of Bell states and local operations. For detection of eavesdropping, the EPR pairs were divided into two parts: the checking parts and the encoding parts. After insuring the security of the quantum channel by measuring the checking particles in conjugate bases, the sender encoded her bits via the local unitary operations on the encoding parts. Investigation shows that the protocol is secure and two Bell states can be used to share two bits message.

Beijing Youdian Xueyuan xuebao•Jan 1, 2005•2 citations

Multiparty quantum secret sharing of classical messages based on entanglement swapping

Zhanjun Zhang, Zhong‐Xiao Man

A multiparty quantum secret sharing (QSS) protocol of classical messages (i.e., classical bits) is proposed by using swapping quantum entanglement of Bell states. The secret messages are imposed on Bell states by local unitary operations. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In addition, dense coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed and confirmed even in a noisy quantum channel.

arXiv:quant-ph/0406103•Physical Review A•Aug 4, 2005•416 citations

Information Leakage Estimates in Quantum Cryptography

Boris A. Slutsky, Ramesh R. Rao, Lubo Tancevski +2 more

Quantum cryptography permits two parties, who share no secret information initially, to communicate over an open channel and establish between themselves a shared secret sequence of bits [1]. Quantum cryptography is provably secure against an eavesdropping attack because any attempt by a third party to monitor a quantum cryptographic channel reveals itself through transmission errors between the legitimate users.

Optics in Computing•Jan 1, 1997•0 citations

Multiparty Zero-Error Classical Channel Coding With Entanglement

Teresa Piovesan, Giannicola Scarpa, Christian Schaffner

We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.

arXiv:1403.5003•IEEE Transactions on Information Theory•Dec 10, 2014•4 citations

A novel approach for secure multi-party secret sharing scheme via Quantum cryptography

Noor ul Ain

Classical secret sharing proposed by Shamir used classical computational power in classical cryptography to achieve secret key sharing, but with the advent of quantum systems, computational power can be overruled. To ensure a secure secret sharing scheme independent of computational power, a scheme independent of computational complexity is needed to achieve security. This paper will provide a protocol dependent on inherent secure nature of quantum cryptography (quantum no cloning theorem and quantum measurement rule). A secure multiparty quantum secret sharing scheme has been proposed to ensure that no one can eavesdrop or extract any share of the secret message via inherent security provided by quantum entanglement swapping and quantum teleportation. Entanglement swapping is a process that allows two non-interacting quantum systems to be entangled. Whereas, Quantum teleportation allows a party to send a qubit to another entangled party without sending the qubit over the channel. Moreover, in order to ensure security against possible active attacks, sender himself will generate and distribute EPR pairs to be used in the scheme. Result will be a secure multiparty QSS scheme which will be secure against internal and external eavesdropping, masquerading and brute-force attacks.

International Conference on Communication, Computing and Digital Systems (C-CODE)•Mar 1, 2017•11 citations

An efficient quantum secret sharing using secure direct communication

Mahsa Khorrampanah, Monireh Houshmand

Inspired by quantum secure direct communication, a three-party quantum secret sharing approach is proposed. In the preparation phase, the sender shares a GHZ state among users. After she ensures about the security of the channel, she generates an auxiliary GHZ state and keeps it. Then she encodes three-bit information on the GHZ states, by applying the appropriate gates on her qubits. In the decoding phase, the three parties measure their qubits. The receivers achieve no information on the encoded message individually and just when they know the others' measurement results have access to the secret message. The security of the preparation phase against various attacks is investigated. Since no qubits carrying the message are transmitted, the protocol is completely secure, if the perfect quantum channel is used. The proposed approach has a better efficiency as compared to the previous ones.

Iranian Conference on Electrical Engineering•May 1, 2013•10 citations
Secret sharing is a protocol in which a boss'' wants to send a classical message secretly to two subordinates,'' such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing---a parallel of the Csisz'ar-K"orner criterion in single-receiver classical cryptography.
To improve the efficiency of quantum secret sharing, a protocol share the message directly among the users was proposed. The scheme made full use of entanglement swapping of Bell states and local operations. For detection of eavesdropping, the EPR pairs were divided into two parts: the checking parts and the encoding parts. After insuring the security of the quantum channel by measuring the checking particles in conjugate bases, the sender encoded her bits via the local unitary operations on the encoding parts. Investigation shows that the protocol is secure and two Bell states can be used to share two bits message.
A multiparty quantum secret sharing (QSS) protocol of classical messages (i.e., classical bits) is proposed by using swapping quantum entanglement of Bell states. The secret messages are imposed on Bell states by local unitary operations. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In addition, dense coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed and confirmed even in a noisy quantum channel.
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.
Classical secret sharing proposed by Shamir used classical computational power in classical cryptography to achieve secret key sharing, but with the advent of quantum systems, computational power can be overruled. To ensure a secure secret sharing scheme independent of computational power, a scheme independent of computational complexity is needed to achieve security. This paper will provide a protocol dependent on inherent secure nature of quantum cryptography (quantum no cloning theorem and quantum measurement rule). A secure multiparty quantum secret sharing scheme has been proposed to ensure that no one can eavesdrop or extract any share of the secret message via inherent security provided by quantum entanglement swapping and quantum teleportation. Entanglement swapping is a process that allows two non-interacting quantum systems to be entangled. Whereas, Quantum teleportation allows a party to send a qubit to another entangled party without sending the qubit over the channel. Moreover, in order to ensure security against possible active attacks, sender himself will generate and distribute EPR pairs to be used in the scheme. Result will be a secure multiparty QSS scheme which will be secure against internal and external eavesdropping, masquerading and brute-force attacks.
Inspired by quantum secure direct communication, a three-party quantum secret sharing approach is proposed. In the preparation phase, the sender shares a GHZ state among users. After she ensures about the security of the channel, she generates an auxiliary GHZ state and keeps it. Then she encodes three-bit information on the GHZ states, by applying the appropriate gates on her qubits. In the decoding phase, the three parties measure their qubits. The receivers achieve no information on the encoded message individually and just when they know the others' measurement results have access to the secret message. The security of the preparation phase against various attacks is investigated. Since no qubits carrying the message are transmitted, the protocol is completely secure, if the perfect quantum channel is used. The proposed approach has a better efficiency as compared to the previous ones.