An Efficient Protocol for the Secure Multi-party Quantum Summation

Chen, Xiu-Bo; Xu, Gang; Yang, Yixian; Wen, Qiaoyan

doi:10.1007/s10773-010-0472-5

Cited by 85 publications

(56 citation statements)

References 22 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Such cooperative recovery can be achieved by introducing the secure two-party sum computation [34], where the secrets l 1 and l 2 serve as the input and l 1 + l 2 as the output.…”

Section: Figmentioning

confidence: 99%

See 1 more Smart Citation

A novel protocol for multiparty quantum key management

Chen

Dou

et al. 2015

Quantum Inf Process

Self Cite

View full text Add to dashboard Cite

Key management plays a fundamental role in the field of cryptography. In this paper, we propose a novel multiparty quantum key management (QKM) protocol. Departing from single-function quantum cryptography protocols, our protocol has a salient feature in that it accomplishes a complete QKM process. In this process, we can simultaneously realize the functions of key generation, key distribution and key backup by executing the protocol once. Meanwhile, for the first time, we propose the idea of multi-function QKM. Firstly, the secret key is randomly generated by managers via the quantum measurements in d-level Bell basis. Then, through entanglement swapping, the secret key is successfully distributed to users. Under circumstances of urgent requirement, all managers can cooperate to recover the users' secret key, but neither of them can recover it unilaterally. Furthermore, this protocol is further generalized into the multi-manager and multi-user QKM scenario. It has clear advantages in the burgeoning area of quantum security group communication. In this system, all group members share the same group key, and group key management is the foundation of secure group communication and hence an important subject of study.

show abstract

“…Such cooperative recovery can be achieved by introducing the secure two-party sum computation [34], where the secrets l 1 and l 2 serve as the input and l 1 + l 2 as the output.…”

Section: Figmentioning

confidence: 99%

“…As for key backup, each of the two managers keeps parts of the key l 1 or l 2 securely. Finally, the secret key can be easily recovered by secure computation [34].…”

Section: Figmentioning

confidence: 99%

A novel protocol for multiparty quantum key management

Chen

Dou

et al. 2015

Quantum Inf Process

Self Cite

View full text Add to dashboard Cite

show abstract

“…Now, secure multi-party computation (SMC) has been discussed in the quantum cryptographic field. Many special SMC problems have been solved in quantum setting, for instance, secure multiparty quantum summation [20,21], quantum protocol for anonymous voting and surveying [22,23], quantum protocol for millionaire problem [24], etc.…”

Section: Introductionmentioning

confidence: 99%

New Quantum Private Comparison Protocol Using χ-Type State

Wang

Jiang

et al. 2012

Int J Theor Phys

View full text Add to dashboard Cite

We present a new quantum private comparison protocol based on the four-particle χ -type states. Different from previous protocols using the four-particle χ -type states, our protocol have some advantages. Without using the entangled character, we only need to prepare one type of χ -type state and N χ-type states. And we use the Pauli local unitary operation on particles to encode the information and to extract information by measurement. We also discuss that our protocol can withstand all various kinds of outside attacks and participant attacks.

show abstract

“…Comparing with QKD, DSQC can be used to obtain deterministic information, not a randomly binary string. So far, DSQC has been actively pursued by some groups [27][28][29][30][31][32][33][34][35][36][37][38][39][40][41][42]. For example, in 2002, Beige et al [28] first proposed a DSQC scheme based on single-photon two-qubit states.…”

Section: Introductionmentioning

confidence: 99%

“…In 2010, Zhou et al [40] proposed two DSQC protocols by utilizing Bell states and GHZ states respectively. Recently, Chen et al [41] proposed a new efficient DSQC scheme which allows a group of mutually distrustful players to perform the summation computation.…”

Section: Introductionmentioning

confidence: 99%

High-capacity Deterministic Secure Four-qubit W State Protocol for Quantum Communication Based on Order Rearrangement of Particle Pairs

et al. 2011

View full text Add to dashboard Cite

A novel high-capacity protocol for deterministic secure quantum communication with four-qubit symmetric W state is proposed. In the presented protocol, the secret messages can be encoded on the four-qubit symmetric W states by employing four two-particle unitary operations and directly decoded by utilizing the corresponding measurements in Bell basis or single particle basis. It has a high capacity as each W state can carry two bits of secret information, and has a high intrinsic efficiency because almost all the instances are useful. The security of this communication can be ensured by the decoy photon checking technique and the order rearrangement of particle pairs technique. Furthermore, this protocol is feasible with present-day technique.

show abstract

An Efficient Protocol for the Secure Multi-party Quantum Summation

Cited by 85 publications

References 22 publications

A novel protocol for multiparty quantum key management

A novel protocol for multiparty quantum key management

New Quantum Private Comparison Protocol Using χ-Type State

High-capacity Deterministic Secure Four-qubit W State Protocol for Quantum Communication Based on Order Rearrangement of Particle Pairs

Contact Info

Product

Resources

About