Mei-Yu Wang, Feng-Li Yan
We present a scheme for three-party simultaneous quantum secure direct communication by using EPR pairs. In the scheme, three legitimate parties can simultaneously exchange their secret messages. It is also proved to be secure against the intercept-and-resend attack, the disturbance attack and the entangled-and-measure attack.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
This paper has been withdrawn by the author(s)
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.
Generating $k$ EPR-pairs from an $n$-party resource state
本研究面向经典信道下的量子网络应用，探索可通过LOCC协议生成k对不相交EPR对的n方资源态，给出了多方持恒定量子比特时k接近最优的构造、单量子比特情形下基于Reed-Muller码的构造及小规模实例，并证明了k取最优时的量子比特数下界。
Einstein-Podolsky-Rosen (EPR) steering, a category of quantum nonlocal correlations describing the ability of one observer to influence another party's state via local measurements, is different from both entanglement and Bell nonlocality by possessing an asymmetric property. For multipartite EPR steering, the monogamous situation, where two observers cannot simultaneously steer the state of the third party, has been investigated rigorously both in theory and experiment. In contrast to the monogamous situation, the shareability of EPR steering in reduced subsystems allows the state of one part…
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.
This paper was withdrawn on 20.11.97.
This paper was withdrawn on 20.11.97.
Einstein-Podolsky-Rosen (EPR) steering is a quantum mechanical phenomenon that allows one party to steer the state of a distant party by exploiting their shared entanglement. It has potential applications in secure quantum communication. In this paper, we present two swapping schemes of Gaussian EPR steering, single-channel and dual-channel schemes, by the technique of entanglement swapping. Two space-separated independent EPR steering states without a direct interaction present EPR steering after deterministic swapping. By comparing the EPR steering of the single-channel and dual-channel sche…
We present a three-party simultaneous quantum secure direct communication (QSDC) scheme by using Greenberger-Horne-Zeilinger (GHZ) states. This scheme can be directly generalized to $N$-party QSDC by using $n$-particle GHZ states. We show that the many-party simultaneous QSDC scheme is secure not only against the intercept-and-resend attack but also against the disturbance attack.
In this paper, we investigate the communication cost of reproducing Einstein-Podolsky-Rosen (EPR) steering correlations arising from bipartite quantum systems. We characterize the set of bipartite quantum states which admits a local hidden state model augmented with $c$ bits of classical communication from an untrusted party (Alice) to a trusted party (Bob). In case of one bit of information ($c=1$), we show that this set has a nontrivial intersection with the sets admitting a local hidden state and a local hidden variables model for projective measurements. On the other hand, we find that an …
We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M \geq 2$ parties and to $N \geq 2$ outcomes for any chosen outcome biases, and show them unconditionally secure. Our results prove that the most general random secure multi-party computation, where all parties receive the output and there is no secret input by any party, can be implemented with unconditional security. Our protocols extend Kent's [A. Kent, Phys. Rev. Lett. 83, 5382 (1999)] two-party unbiased coin flipping protocol, do not require any quantum communication, are practical to implem…
I construct a secure multi-party scheme to compute a classical function by a succinct use of a specially designed fault-tolerant random polynomial quantum error correction code. This scheme is secure provided that (asymptotically) strictly greater than five-sixths of the players are honest. Moreover, the security of this scheme follows directly from the theory of quantum error correcting code, and hence is valid without any computational assumption. I also discuss the quantum-classical complexity-security tradeoff in secure multi-party computation schemes and argue why a full-blown quantum cod…
Einstein-Podolsky-Rosen (EPR) steering is a form of quantum nonlocality which is intermediate between entanglement and Bell nonlocality. EPR steering is a resource for quantum key distribution that is device independent on only one side in that it certifies bipartite entanglement when one party's device is not characterized while the other party's device is fully characterized. In this work, we introduce two types of genuine tripartite EPR-steering, and derive two steering inequalities to detect them. In a semi-device-independent scenario where only the dimensions of two parties are assumed, t…
We introduce a scheme for secure multi-party computation utilising the quantum correlations of entangled states. First we present a scheme for two-party computation, exploiting the correlations of a Greenberger-Horne-Zeilinger state to provide, with the help of a third party, a near-private computation scheme. We then present a variation of this scheme which is passively secure with threshold t=2, in other words, remaining secure when pairs of players conspire together provided they faithfully follow the protocol. We show that this can be generalised to computations of n-party polynomials of d…
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the …
Recently, Yang et al. (Quantum Inf Process:17:129, 2018) proposed a secure multi-party quantum summation protocol allowing the involved participants to sum their secrets privately. They claimed that the proposed protocol can prevent each participant's secret from being known by others. However, this study shows that the participant who prepares the initial quantum states can obtain other participants' secrets with an inverse quantum Fourier transform attack. A modification is then proposed here to solve this problem.
Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the receiver Bob, functions as quantum information channels for faithful transmission. After insuring the security of the quantum channel and obtaining the permission of Charlie (i.e. Charlie is trustworthy and cooperative, which means the 'conditional' in the two schemes), Alice and Bob begin their private communication under the control of Charlie. In the first schem…
Monogamy inequalities for the way bipartite EPR steering can be distributed among N systems are derived. One set of inequalities is based on witnesses with two measurement settings, and may be used to demonstrate correlation of outcomes between two parties, that cannot be shared with more parties. It is shown that the monogamy for steering is directional. Two parties cannot independently demonstrate steering of a third system, using the same two-setting steering witness, but it is possible for one party to steer two independent systems. This result explains the monogamy of two-setting Bell ine…
Based on an EPR pair of qubits and allowing asymptotically secure key distribution, a secure communication protocol is presented. Bob sends either of the EPR pair qubits to Alice. Alice receives the travel qubit. Then she can encode classical information by local unitary operations on this travel qubit. Alice send the qubit back to Bob. Bob can get Alice's information by measurement on the two photons in Bell operator basis. If Eve in line, she has no access to Bob's home qubit. All her operations are restricted to the travel qubit. In order to find out which opeartion Alice performs, Eve's op…
We analyze the capacity of a simultaneous quantum secure direct communication scheme between the central party and other $M$ parties via $M+1$-particle GHZ states and swapping quantum entanglement. It is shown that the encoding scheme should be secret if other $M$ parties wants to transmit $M+1$ bit classical messages to the center party secretly. However when the encoding scheme is announced publicly, we prove that the capacity of the scheme in transmitting the secret messages is 2 bits, no matter how big $M$ is.
In this paper, we propose a novel secure multi-party quantum summation protocol based on quantum Fourier transform, where the traveling particles are transmitted in a tree-type mode. The party who prepares the initial quantum states is assumed to be semi-honest, which means that she may misbehave on her own but will not conspire with anyone. The proposed protocol can resist both the outside attacks and the participant attacks. Especially, one party cannot obtain other parties' private integer strings; and it is secure for the colluding attack performed by at most n-2 parties, where n is the nu…
We derive a new inequality that is necessary and sufficient to show EPR-steering in a scenario employing only correlations between two arbitrary dichotomic measurements on each party. Thus the inequality is a complete steering analogy of the CHSH inequality, a generalisation of the result of Cavalcanti et al, JOSA B, 32(4), A74 (2015). We show that violation of the inequality only requires measuring over equivalence classes of mutually unbiased measurements on the trusted party and in fact assuming a general two qubit system arbitrary pairs of distinct projective measurements at the trusted pa…
We presen a secure direct communication protocol by using step-split Einstein-Podolsky-Rosen (EPR) pair. In this communication protocol, Alice first sends one qubit of an EPR pair to Bob. Bob sends a receipt signal to Alice through public channel when he receives Alice's first qubit. Alice performs her encoding operations on the second qubit and sends this qubit to Bob. Bob performs a Bell-basis measurement to draw Alice's information. The security of this protocol is based on `High fidelity implies low entropy'. If Eve want to eavesdrop Alice's information, she has to attack both qubits of th…
This paper studies secure multiparty quantum computation (SMQC) without nonlocal measurements. Firstly, this task is reduced to secure two-party quantum computation of nonlocal controlled-NOT (NL-CNOT) gate. Then, in the passive adversaries model, the secure computation of NL-CNOT is reduced to bit commitment. Thus, a SMQC scheme can be constructed based on bit commitment. This scheme does not depend on trusted third party, and is secure in the passive adversaries model. It is also pointed out that a vulnerability exists in any secure two-party quantum computation protocol of NL-CNOT gate.
In this letter a deterministic secure direct bidirectional communication protocol is proposed by using the quantum entanglement and local unitary operations on one photon of the Einstein-Podolsky-Rosen (EPR) photon pair.
In this paper, we build upon the model of two-party quantum computation introduced by Salvail et al. [SSS09] and show that in this model, only trivial correct two-party quantum protocols are weakly self-composable. We do so by defining a protocol Π, calling any non-trivial sub-protocol πN times and showing that there is a quantum honest-but-curious strategy that cannot be modeled by acting locally in every single copy of π. In order to achieve this, we assign a real value called "payoff" to any strategy for Πand show that that there is a gap between the highest payoff achievable by coherent an…
The demonstration of quantum teleportation of a photonic qubit from Alice to Bob usually relies on data conditioned on detection at Bob's location. I show that Bohm's Einstein-Podolsky-Rosen (EPR) paradox can be used to verify that the quantum benchmark for qubit teleportation has been reached, without postselection. This is possible for scenarios insensitive to losses at the generation station, and with efficiencies of $η_{B}>1/3$ for the teleportation process. The benchmark is obtained, if it is shown that Bob can {}"steer" Alice's record of the qubit as stored by Charlie. EPR steering inequ…
We propose a simultaneous quantum secure direct communication scheme between one party and other three parties via four-particle GHZ states and swapping quantum entanglement. In the scheme, three spatially separated senders, Alice, Bob and Charlie, transmit their secret messages to a remote receiver Diana by performing a series local operations on their respective particles according to the quadripartite stipulation. From Alice, Bob, Charlie and Diana's Bell measurement results, Diana can infer the secret messages. If a perfect quantum channel is used, the secret messages are faithfully transm…
In this article, we present the unbalanced quantum error correcting codes(one-party-QECC), a novel idea for correcting unbalanced quantum errors. In some quantum communication tasks using entangled pairs, the error distributions between two parts of the pairs are unbalanced, and. one party holds the whole entangled pairs at the final stage, and he or she is able to perform joint measurements on the pairs. In this situation the proposed one-party-QECC can improve error correction by allowing a higher tolerated error rate. We have established the general correspondence between linear classical c…
In a measurement-device-independent or quantum-refereed protocol, a referee can verify whether two parties share entanglement or Einstein-Podolsky-Rosen (EPR) steering without the need to trust either of the parties or their devices. The need for trusting a party is substituted by a quantum channel between the referee and that party, through which the referee encodes the measurements to be performed on that party's subsystem in a set of nonorthogonal quantum states. In this Letter, an EPR-steering inequality is adapted as a quantum-refereed EPR-steering witness, and the trust-free experimental…
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 …
In this paper, we propose a two-party semiquantum summation protocol, where two classical users can accomplish the summation of their private binary sequences with the assistance of a quantum semi-honest third party (TP). The term 'semi-honest' implies that TP cannot conspire with others but is able to implement all kinds oof attacks. This protocol employs logical qubits as traveling particles to overcome the negative influence of collective-dephasing noise and needn't make any two parties pre-share a random secret key. The security analysis turns out that this protocol can effectively prevent…
We consider the task of secure multi-party distributed quantum computation on a quantum network. We propose a protocol based on quantum error correction which reduces the number of necessary qubits. That is, each of the $n$ nodes in our protocol requires an operational workspace of $n^2+Θ(s) n$ qubits, as opposed to previously shown $Ω\big((n^3+n^2s^2)\log n\big)$ qubits, where $s$ is a security parameter. To achieve universal computation, we develop a distributed procedure for verifying magic states based on magic state distillation and statistical testing of randomly selected states. This al…
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)
本文利用共享 EPR 对构造随机接收方一次性字符串 OT，并据此实现安全量子隐形传态及 NIZK 等应用，还提出两轮最优、无条件安全的经典功能 MPC 协议。
Recently, a quantum multi-party summation protocol based on the quantum Fourier transform has been proposed [Quantum Inf Process 17: 129, 2018]. The protocol claims to be secure against both outside and participant attacks. However, a closer look reveals that the player in charge of generating the required multi-partite entangled states can launch two kinds of attacks to learn about other parties' private integer strings without being caught. In this paper, we present these attacks, and propose countermeasures to make the protocol secure again. The improved protocol not only can resist these a…
We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.
The quantum key distribution network with Vernam's One Time Pad encryption and secret sharing are powerful security tools to realize an information theoretically secure distributed storage system. In our previous work, a single-password-authenticated secret sharing scheme based on the QKD network and Shamir's secret sharing was experimentally demonstrated; it confirmed ITS data transmission, storage, authentication, and integrity. To achieve data integrity, an ITS message authentication code tag is employed and a data owner of the secret sharing performs both the MAC tag generation and verific…
In this paper, a lightweight three-user secure quantum summation protocol is put forward by using single-particle states, which can accomplish the goal that three users cooperate together to calculate the modulo 2 addition of their private messages without the help of a third party. This protocol only requires single-particle states rather than quantum entangled states as the initial quantum resource, and only needs single-particle measurements and Bell basis measurements. This protocol needs none of quantum entanglement swapping, the Pauli operations, the controlled-not (CNOT) operation, the …
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. In this paper, the scope of this general impossibility proof is extended and analyzed, and gaps are found. Three specific protocols are described for which the entanglement cheating as given…
Since unconditionally secure quantum two-party computations are known to be impossible, most existing quantum private comparison (QPC) protocols adopted a third party. Recently, we proposed a QPC protocol which involves two parties only, and showed that although it is not unconditionally secure, it only leaks an extremely small amount of information to the other party. Here we further propose the device-independent version of the protocol, so that it can be more convenient and dependable in practical applications.
Einstein-Podolsky-Rosen (EPR) steering exhibits an inherent asymmetric feature that differs from both entanglement and Bell nonlocality, which leads to one-way EPR steering. Although this one-way EPR steering phenomenon has been experimentally observed, the schemes to manipulate the direction of EPR steering have not been investigated thoroughly. In this paper, we propose and experimentally demonstrate three schemes to manipulate the direction of EPR steering, either by varying the noise on one party of a two-mode squeezed state (TMSS) or transmitting the TMSS in a noisy channel. The dependenc…
A protocol for quantum bit commitment is proposed. The protocol is feasible with present technology and is secure against cheaters with unlimited computing power as long as the sender does not have the technology to store an EPR particle for an arbitrarily long period of time. The protocol is very efficient, requiring only tens of particles.
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks without the need for mutual trust. Examples of such tasks are private access to a database, and secure identification. Quantum communication enables security for all of these problems in the noisy-storage model by sending more signals than the adversary can store in a certain time frame. Here, we initiate the study of device-independent protocols for two-party cryptography in the noisy-storage model. Specifically, we present a relatively easy to implement protocol for a cryptographic building bloc…
Secure multi-party quantum computation (MPQC) protocol is a versatile tool that enables error-free distributed quantum computation to a group of $n$ mutually distrustful quantum nodes even when some of the quantum nodes do not follow the instructions of the protocol honestly. However, in case of the MPQC protocols built on top of the quantum error correction technique, the versatility is significantly affected by the fact that one has to choose a particular quantum error-correcting code (QECC), which immediately applies a constraint on the number of quantum nodes $n$. Therefore, in this talk, …
We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local measurement on her particles of the EPR pairs and informs Bob the encoding classical information publicly. According to Alice's classical information and his measurement outcomes on the EPR pairs Bob can infer the secret messages directly. In this scheme, to transmit one bit secret message, the sender Alice only needs to send one bit classical information to the r…
We present a secure multi-party quantum summation protocol based on quantum teleportation, in which a malicious, but non-collusive, third party (TP) helps compute the summation. In our protocol, TP is in charge of entanglement distribution and Bell states are shared between participants. Users encode the qubits in their hand according to their private bits and perform Bell-state measurements. After obtaining participants' measurement results, TP can figure out the summation. The participants do not need to send their encoded states to others, and the protocol is therefore congenitally free fro…
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. In this paper, the scope of this general impossibility proof is analyzed, and gaps are found. Two variants of a bit commitment scheme utilizing anonymous quantum states and d…
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…
Anonymous multi-party quantum computation with a third party
本文修改了原有协议，首次提出由第三方执行的匿名多方量子计算，第三方忠实执行但不关心数据所有者身份，并提出新的匿名协议。
Quantum conference is a process of securely exchanging messages between three or more parties, using quantum resources. A Measurement Device Independent Quantum Dialogue (MDI-QD) protocol, which is secure against information leakage, has been proposed (Quantum Information Processing 16.12 (2017): 305) in 2017, is proven to be insecure against intercept-and-resend attack strategy. We first modify this protocol and generalize this MDI-QD to a three-party quantum conference and then to a multi-party quantum conference. We also propose a protocol for quantum multi-party XOR computation. None of th…
Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output. In this work, we consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. Our first result shows that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. In particular, we show that the existence of a secure quantum computing protocol that relies only on classical channels …
By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally secure protocol. The well-known ``impossibility proof'' does not cover such protocols due to its different commitment and opening prescriptions, which necessitate actual quantum measurements among different possible systems that cannot be entangled as a consequence.
The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols. We present a quantum version of the UC model which enjoys the same compositionality guarantees. We prove that in this model statistically secure oblivious transfer protocols can be constructed from commitments. Furthermore, we show that every statistically classically UC secure protocol is also statistically quantum UC secure. Such implications are not known for other quantum security definitions. As a corollary, we get that quantum UC secure protocols for general multi-party com…
Quantum steering enables one party to communicate with another remote party even if the sender is untrusted. Such characteristics of quantum systems not only provide direct applications to quantum information science, but are also conceptually important for distinguishing between quantum and classical resources. While concrete illustrations of steering have been shown in several experiments, quantum steering has not been certified for higher dimensional systems. Here, we introduce a simple method to experimentally certify two different kinds of quantum steering: Einstein-Podolsky-Rosen (EPR) s…
Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary, and is experi…
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious. Our construction requires two ideal functionalities to garantee privacy: a private SWAP between registers held by the two parties and a classical private AND-box equivalent to oblivious transfer. If the unitary to be evaluated is in the Clifford group then only one call to SWAP is required for privacy. On the other hand, any unitary not in the Cliff…
After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner, but, also, to introduce a new protocol for non-relativistic strong coin tossing. This protocol matches the security of the best protocol known to date while using a conceptually different approach to achieve the task. In the second part variable bias coin tossing is introduced. This is a variant of coin tossing in which one party secretly chooses one of two b…
Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes
提出改进的MPQC协议，利用三重偶数量子纠错码替代自对偶码，消除了资源密集的“魔法”态验证步骤，并将每个节点所需量子比特数从 $n^2 + Θ(r)n$ 降至 $n^2 + 3n$，提升了近期技术可行性。
We obtain a four-photon polarization-entangled state with a visibility as high as (95.35\pm 0.45)% directly from a single down-conversion source. A success probability of (81.54\pm 1.38)% is observed by applying this entangled state to realize a four-party quantum communication complexity scenario (QCCS), which comfortably surpass the classical limit of 50%. As a comparison, two Einstein-Podolsky-Rosen (EPR) pairs are shown to implement the scenario with a success probability of (73.89\pm 1.33)%. This four-photon state can be used to fulfill decoherence-free quantum information processing and …
Einstein-Rosen-Podolsky (EPR) steering or quantum steering describes the "spooky-action-at-a-distance" that one party is able to remotely alter the states of the other if they share a certain entangled state. Generally, it admits an operational interpretation as the task of verifying entanglement without trust in the steering party's devices, making it lying intermediate between Bell nonlocality and entanglement. Together with the asymmetrical nature, quantum steering has attracted a considerable interest from theoretical and experimental sides over past decades. In this Perspective, we presen…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。