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:0708.0902 · Physical Review A

Multiparty quantum-key-distribution protocol without use of entanglement

Ryutaroh Matsumoto

Published Dec 20, 2007• 55 citations
arXivHTMLPDF

Abstract

We propose a quantum-key-distribution protocol that enables three parties to agree at once on a shared common random bit string in the presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate.
DOI
10.1103/physreva.76.062316

Related papers

Quantum multiparty key distribution protocol without use of entanglement

隆太郎 松本, Ryutaroh Matsumoto

We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate

•Nov 1, 2007•0 citations

Multiparty key distribution and secret sharing based on entanglement swapping

Adán Cabello

A general proof of the security against eavesdropping of a previously introduced protocol for two-party quantum key distribution based on entanglement swapping [Phys. Rev. A {\bf 61}, 052312 (2000)] is provided. In addition, the protocol is extended to permit multiparty quantum key distribution and secret sharing of classical information.

arXiv:quant-ph/0009025•Sep 7, 2000•51 citations

Simple Post Quantum Scheme for Higher Key Rate Multiparty Quantum Key Distribution

Abudhahir Buhari

We propose a multi-party quantum key distribution protocol which enables all the receivers can convert their respective private shared key into common secret key without use of entanglement.The main component of our protocol is a simple post quantum scheme for achieving the higher secret key rate.Efficiency of the extracted key rate is almost 100%.We assume that sender established the pre-shared private secret keys and a common secret number with the receivers.Our proposed scheme sends n strings of number to n receivers in the public channel to convert their respective shared secret key into common secret key in the presence of Eve.We also analyze the complexity of attack by the adversary to guess the secret key.

International Journal of Network Security & Its Applications•Sep 30, 2012•1 citation

Efficient quantum key distribution secure against no-signalling eavesdroppers

Antonio Acín, Serge Massar, Stefano Pironio

By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical 'post-quantum' eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.

arXiv:quant-ph/0605246•New Journal of Physics•Aug 2, 2006•164 citations

Unconditionally Secure Multipartite Quantum Key Distribution

Sudhir Kumar Singh, R. Srikanth

We consider the problem of secure key distribution among $n$ trustful agents: the goal is to distribute an identical random bit-string among the $n$ agents over a noisy channel such that eavesdroppers learn little about it. We study the general situation where the only resources required are secure bipartite key distribution and authenticated classical communication. Accordingly, multipartite quantum key distribution can be proven unconditionally secure by reducing the problem to the biparitite case and invoking the proof of security of bipartite quantum key distribution.

arXiv:quant-ph/0306118•Jun 17, 2003•10 citations

High Efficient Multi-party Quantum Secret Sharing Scheme

Xiaoqian Zhang, Xiaoqing Tan, Cui Liang

Multi-party quantum secret sharing scheme with high efficient based on entanglement states is proposed and analyzed. A three-party which is presented shares a sequence of joint key bits. In this scheme, a general proof of the security against eavesdropping for three-party quantum secret sharing based on entanglement swapping is provided. The scheme which is showed is secure against a dishonest participant's intercept-and-resend attack and eavesdropper's entangle auxiliary-particles attack. In case of eavesdropping attacks with full information again, the detection bit needs to be transmitted except those for detection, the total efficiency of the scheme approaches to 100%. The protocol can be generalized to N-party system by using N-partite entanglement states.

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)•Nov 1, 2014•0 citations
We propose a multi-party quantum key distribution protocol which enables all the receivers can convert their respective private shared key into common secret key without use of entanglement.The main component of our protocol is a simple post quantum scheme for achieving the higher secret key rate.Efficiency of the extracted key rate is almost 100%.We assume that sender established the pre-shared private secret keys and a common secret number with the receivers.Our proposed scheme sends n strings of number to n receivers in the public channel to convert their respective shared secret key into common secret key in the presence of Eve.We also analyze the complexity of attack by the adversary to guess the secret key.
By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical 'post-quantum' eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.
We consider the problem of secure key distribution among nnn trustful agents: the goal is to distribute an identical random bit-string among the nnn agents over a noisy channel such that eavesdroppers learn little about it. We study the general situation where the only resources required are secure bipartite key distribution and authenticated classical communication. Accordingly, multipartite quantum key distribution can be proven unconditionally secure by reducing the problem to the biparitite case and invoking the proof of security of bipartite quantum key distribution.
Multi-party quantum secret sharing scheme with high efficient based on entanglement states is proposed and analyzed. A three-party which is presented shares a sequence of joint key bits. In this scheme, a general proof of the security against eavesdropping for three-party quantum secret sharing based on entanglement swapping is provided. The scheme which is showed is secure against a dishonest participant's intercept-and-resend attack and eavesdropper's entangle auxiliary-particles attack. In case of eavesdropping attacks with full information again, the detection bit needs to be transmitted except those for detection, the total efficiency of the scheme approaches to 100%. The protocol can be generalized to N-party system by using N-partite entanglement states.