Secure Multiparty Quantum Research Articles

A Novel and Efficient Quantum Private Comparison Scheme

A quantum private comparison is a primitive protocol of secure multiparty quantum computation that enables two parties to privately decide whether x = y or not, given two integers x and y, that are held as private inputs by the two parties, respectively. However, many existing quantum private comparison schemes may not be efficient enough, especially applied in big-data and large-scale network environments, because of low efficiency bit-by-bit comparisons. In this paper, we present a novel and efficient quantum private comparison scheme. The proposed scheme provides higher communication efficiency because a secret-by-secret comparison instead of a bit-by-bit comparison is used.

Improving the Security of ‘High-Capacity Quantum Summation with Single Photons in both Polarization and Spatial-Mode Degrees of Freedom’

In 2014, Zhang et al. (Int J Theor Phys:53:933–941, 2014) proposed a secure multi-party quantum summation protocol based on single photons in both polarization and spatial-mode degrees of freedom. They claimed that the proposed protocol can efficiently help the involved participants to sum their secrets, and at the same time, each participant’s secret can be kept from being known by others. However, this study shows that Zhang et al.’s protocol suffers from the intercept-resend attack. To solve this problem, a modification is proposed here.

Quantum secret sharing affected by vacuum fluctuation

Quantum secret sharing (QSS) as an important protocol of secure multiparty quantum computation plays a vital role in quantum cryptography. In the real world, any quantum communication protocols are inevitably affected by external noisy environment. In this paper, we investigate the influence of vacuum fluctuation of a massless scalar field on QSS. We firstly construct the noisy model of QSS via two uniformly accelerated atoms coupled with a fluctuating massless scalar field with a perfectly reflecting plane boundary and then derive the master equation that governs the QSS evolution. It is shown that fluctuation of scalar field would lower the performance of QSS. Furthermore, we analyze the impacts of acceleration, two-atom separation and distance from the boundary on the QSS. It is found that increasing acceleration weakens the QSS performance, but in the presence of the reflecting boundary, QSS performance can be improved effectively.

Secure multi-party quantum summation based on quantum Fourier transform

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 number of parties. In addition, the proposed protocol calculates the addition of modulo d and implements the calculation of addition in a secret-by-secret way rather than a bit-by-bit way.

Multi-party quantum key agreement protocol secure against collusion attacks

The fairness of a secure multi-party quantum key agreement (MQKA) protocol requires that all involved parties are entirely peer entities and can equally influence the outcome of the protocol to establish a shared key wherein no one can decide the shared key alone. However, it is found that parts of the existing MQKA protocols are sensitive to collusion attacks, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. In this paper, a multi-party QKA protocol resisting collusion attacks is proposed. Different from previous QKA protocol resisting $N-1$ coconspirators or resisting $1$ coconspirators, we investigate the general circle-type MQKA protocol which can be secure against $t$ dishonest participants' cooperation. Here, $t < N$. We hope the results of the presented paper will be helpful for further research on fair MQKA protocols.

Efficient multiparty quantum key agreement protocol based on commutative encryption

A secure multiparty quantum key agreement protocol using single-qubit states is proposed. The agreement key is computed by performing exclusive-OR operation on all the participants' secret keys. Based on the commutative property of the commutative encryption, the exclusive-OR operation can be performed on the plaintext in the encrypted state without decrypting it. Thus, it not only protects the final shared key, but also reduces the complexity of the computation. The efficiency of the proposed protocol, compared with previous multiparty QKA protocols, is also improved. In the presented protocol, entanglement states, joint measurement and even the unitary operations are not needed, and only rotation operations and single-state measurement are required, which are easier to be realized with current technology.

Secure Multiparty Quantum Computation for Summation and Multiplication.

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

Improvements on “multiparty quantum key agreement with single particles”

Recently, Liu et al. (Quantum Inf Process 12: 1797---1805, 2013) proposed a secure multiparty quantum key agreement (MQKA) protocol with single particles. Their protocol allows N parties to negotiate a secret session key in such away that (1) outside eavesdroppers cannot gain the session key without introducing any errors; (2) the session key cannot be determined by any non-trivial subset of the participants. However, the particle efficiency of their protocol is only $$\frac{1}{(k+1)N(N-1)}$$1(k+1)N(N-1). In this paper, we show that the efficiency of the MQKA protocol can be improved to $$\frac{1}{N(k+1)}$$1N(k+1) by introducing two additional unitary operations. Since, in some scenarios, the secret keys are confidential, neither party is willing to divulge any of the contents to the other. Therefore, in our protocol, no participant can learn anything more than its prescribed output, i.e., the secret keys of the participants can be kept secret during the protocol instead of being exposed to others, thus, the privacy of the protocol is also improved. Furthermore, we explicitly show the scheme is secure.

Secure multiparty quantum secret sharing with the collective eavesdropping-check character

Combining the block transmission in Long and Liu (Phys Rev A 65:032302, 2002) and the double operations in Lin et al. (Opt Commun 282:4455, 2009), we propose a secure multiparty quantum secret sharing protocol with the collective eavesdropping-check character. In this protocol, only the boss needs to prepare Bell states and perform Bell state measurements, and all agents only perform local operations, which makes this protocol more feasible with the current technique. Incidentally, we show that the other half of secret messages in Lin et al. protocol (Opt Commun 282:4455, 2009) may also be eavesdropped.

Multiparty quantum secret sharing with the pure entangled two-photon states

We present a secure multiparty quantum secret sharing scheme. The implementation of this scheme only needs to exploit the pure entangled two-photon pairs, the local unitary operations on single photons and the single-photon measurements with the computational basis, which make it more convenient in a practical application than others. In addition, each pure entangled two-photon pair can carry one bit of classical information and the intrinsic efficiency approaches 100%, since no classical bit needs to be transmitted except those for detection.

Research of quantum secure multi-party ranking protocol

Secure multi-party ranking problem is used to rank n private integers without leaking further information. It is an extended problem of secure two-party comparing problem. A secure multi-party quantum ranking protocol in semi-honest model is presented based on the a quantum implicit module n+1 addition. The security for multi-parties of the protocol is analyzed.

Experimental quantum secret sharing using telecommunication fiber

We report quantum secret sharing experiment in telecommunication fiber in five-party implementation. The quantum secret sharing experiment has been based on a single qubit protocol, which has opened the door to practical secret sharing implementation over fiber channels and in free space. The previous quantum secret sharing proposals were based on multiparticle entangled states, difficult in the practical implementation and not scalable. The secret sharing protocol has been implemented in an interferometric fiber optics setup with phase encoding and demonstrated for three, four, and five parties. The experimental setup measurements have shown feasibility and scalability of secure multiparty quantum communication over commercial telecom fiber networks.

An efficient and secure multiparty quantum secret sharing scheme based on single photons

A scheme of multiparty quantum secret sharing of classical messages (QSSCM) is proposed based on single photons and local unitary operations. In this scheme, eavesdropping checks are performed only twice, and one photon can generate one bit of classical secret message except those chosen for eavesdropping check; in addition, only the sender and one of the agents are required to store photons. Thus, this scheme is more practical and efficient.

High-fidelity source of four-photon entanglement

A polarisation-entangled four-photon state can be generated directly by a second order parametric down-conversion process. We use this emission to characterise the properties of a four-qubit state and to analyse its entanglement based on the violation of a four-particle Bell inequality. The observed high count rates and the fidelity of the polarisation correlations are the basis for the realisation of several new multiparty quantum communications schemes, such as secure multiparty key distribution and quantum telecloning.