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

OSA Continuum

Semi-device-independent multiparty quantum key distribution in the asymptotic limit

Yonggi Jo, Wonmin Son

Published Mar 12, 2019• 7 citations
Publisher

Abstract

We present a security analysis of a multiparty quantum key distribution (QKD) based on Mermin-Ardehali-Belinskiĭ-Klyshko (MABK) type multipartite nonlocality. Our analysis provides an asymptotic secret key rate of the multiparty QKD under the restriction that successive trials are completely independent. In our analysis, we construct the relation between a secret key rate of the multiparty QKD and an expectation value of MABK operator. We show that side channel attacks, which can threaten the information theoretic (IT) security analysis of multiparty QKD, are prevented in our analysis. We compare secret key rates obtained by using the IT analysis, the existing fully device-independent analysis, and our analysis. It is shown that efficiency of the multiparty QKD can be improved with increasing number of authorized parties in our analysis as well.

DOI
10.1364/osac.2.000814

Related papers

Entropy Bounds for Multiparty Device-Independent Cryptography

Federico Grasselli, Gláucia Murta, Hermann Kampermann +1 more

Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks.The security of many multipartite device-independent (DI) protocols, such as DI conference-key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality.We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes.From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improves previous results.We obtain the entropy bounds thanks to two general results of independent interest.The first one drastically simplifies the quantum setup of an N -partite Bell scenario.The second one provides an upper bound on the violation of the MABK inequality by an arbitrary N -qubit state, as a function of the state's parameters.

arXiv:2004.14263•PRX Quantum•Jan 14, 2021•25 citations

Non-restrictive state reduction and analytical bounds in a multipartite device-independent scenario

Federico Grasselli, Gláucia Murta, Hermann Kampermann +1 more

Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks. The security of many multipartite device-independent (DI) protocols, such as DI conference key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality. We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes. From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improve previous results. We obtain the entropy bounds thanks to two general results of independent interest. The first one drastically simplifies the quantum setup of an $N$-partite Bell scenario. The second one provides an upper bound on the violation of the MABK inequality by an arbitrary $N$-qubit state, as a function of the state's parameters.

•Apr 29, 2020•0 citations

Fully device-independent conference key agreement

Jérémy Ribeiro, Gláucia Murta, Stephanie Wehner

We present a security analysis of conference key agreement (CKA) in the most adversarial model of device independence (DI). Our protocol can be implemented by any experimental setup that is capable of performing Bell tests [specifically, the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality], and security can in principle be obtained for any violation of the MABK inequality that detects genuine multipartite entanglement among the $N$ parties involved in the protocol. As our main tool, we derive a direct physical connection between the $N$-partite MABK inequality and the Clauser-Horne-Shimony-Holt (CHSH) inequality, showing that certain violations of the MABK inequality correspond to a violation of the CHSH inequality between one of the parties and the other $N\ensuremath{-}1$. We compare the asymptotic key rate for device-independent conference key agreement (DICKA) to the case where the parties use $N\ensuremath{-}1$ device-independent quantum key distribution protocols in order to generate a common key. We show that for some regime of noise the DICKA protocol leads to better rates.

arXiv:1708.00798•Physical Review A•Feb 6, 2018•102 citations

Efficient security analysis for quantum key distribution against side-channel leakage

Luo-Jia Ma, Yue-ying Wang, Ming-Shuo Sun +4 more

Quantum key distribution (QKD) allows the transmission of keys with unconditional security. Nevertheless, a discrepancy remains between the theoretical framework and the practical implementation, as device imperfections are frequently neglected in most QKD protocols. Some previous works proposed to use Hong-Ou-Mandel interference to quantify information leakage from side-channels. However, the security bound was relatively loose, resulting in poor performance. In this paper, we present an improved method for the security analysis of practical QKD protocols and provide a more precise parameter estimation. Furthermore, we apply it to several important QKD protocols, including BB84, measurement-device-independent, and twin-field, and carry out corresponding numerical simulations. Our work demonstrates significant improvements in both the key rate and the transmission distance compared to previous methods, representing a crucial step towards the practical implementation of QKD.

Optics Express•Apr 25, 2025•1 citation

Efficient Multiparty Quantum Key Distribution over Quantum Networks

Samuel Oslovich, Bing Wang, Walter O. Krawec +1 more

Multiparty quantum key distribution (QKD) is useful for many applications that involve secure communication or collaboration among multiple parties. While it can be achieved using pairwise QKD, a more efficient approach is to achieve it using multipartite entanglement distributed over quantum networks that connect the multiple parties. Existing studies on multipartite entanglement distribution, however, are not designed for multiparty QKD, and hence do not aim to maximize secret key generation rate. In this paper, we design efficient strategies for multiparty QKD over quantum networks. For 3-party QKD, we derive closed-form expressions for analyzing key distribution over quantum networks. We then use it to develop an efficient strategy for 3-party QKD by packing multiple stars that connect the 3 parties. For the general form of N-party QKD, we develop an approach that packs multiple trees to connect the N parties, while directly incorporating the estimated key rates on network paths. Extensive evaluation of our strategies, in both grid and random graphs, under a wide range of settings, demonstrates that our schemes achieve high key rate, which degrades gracefully when increasing the number of parties.

arXiv:2404.19720•Apr 30, 2024•1 citation

Semi-device-independent security of one-way quantum key distribution

Marcin Pawłowski, Nicolas Brunner

By testing nonlocality, the security of entanglement-based quantum key distribution (QKD) can be enhanced to being ``device-independent.'' Here we ask whether such a strong form of security could also be established for one-way (prepare and measure) QKD. While fully device-independent security is impossible, we show that security can be guaranteed against individual attacks in a semi-device-independent scenario. In the latter, the devices used by the trusted parties are noncharacterized, but the dimensionality of the quantum systems used in the protocol is assumed to be bounded. Our security proof relies on the analogies between one-way QKD, dimension witnesses, and random-access codes.

arXiv:1103.4105•Physical Review A•Jul 15, 2011•289 citations
We present a security analysis of a multiparty quantum key distribution (QKD) based on Mermin-Ardehali-Belinskiĭ-Klyshko (MABK) type multipartite nonlocality. Our analysis provides an asymptotic secret key rate of the multiparty QKD under the restriction that successive trials are completely independent. In our analysis, we construct the relation between a secret key rate of the multiparty QKD and an expectation value of MABK operator. We show that side channel attacks, which can threaten the information theoretic (IT) security analysis of multiparty QKD, are prevented in our analysis. We compare secret key rates obtained by using the IT analysis, the existing fully device-independent analysis, and our analysis. It is shown that efficiency of the multiparty QKD can be improved with increasing number of authorized parties in our analysis as well.
Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks.The security of many multipartite device-independent (DI) protocols, such as DI conference-key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality.We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes.From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improves previous results.We obtain the entropy bounds thanks to two general results of independent interest.The first one drastically simplifies the quantum setup of an N -partite Bell scenario.The second one provides an upper bound on the violation of the MABK inequality by an arbitrary N -qubit state, as a function of the state's parameters.
Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks. The security of many multipartite device-independent (DI) protocols, such as DI conference key agreement, relies on bounding the von Neumann entropy of the parties' outcomes conditioned on the eavesdropper's information, given the violation of a multipartite Bell inequality. We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single party's outcome and the joint conditional entropy of two parties' outcomes. From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome, while the latter significantly improve previous results. We obtain the entropy bounds thanks to two general results of independent interest. The first one drastically simplifies the quantum setup of an NNN-partite Bell scenario. The second one provides an upper bound on the violation of the MABK inequality by an arbitrary NNN-qubit state, as a function of the state's parameters.
We present a security analysis of conference key agreement (CKA) in the most adversarial model of device independence (DI). Our protocol can be implemented by any experimental setup that is capable of performing Bell tests [specifically, the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality], and security can in principle be obtained for any violation of the MABK inequality that detects genuine multipartite entanglement among the NNN parties involved in the protocol. As our main tool, we derive a direct physical connection between the NNN-partite MABK inequality and the Clauser-Horne-Shimony-Holt (CHSH) inequality, showing that certain violations of the MABK inequality correspond to a violation of the CHSH inequality between one of the parties and the other $N\ensuremath{-}1$. We compare the asymptotic key rate for device-independent conference key agreement (DICKA) to the case where the parties use $N\ensuremath{-}1$ device-independent quantum key distribution protocols in order to generate a common key. We show that for some regime of noise the DICKA protocol leads to better rates.
Quantum key distribution (QKD) allows the transmission of keys with unconditional security. Nevertheless, a discrepancy remains between the theoretical framework and the practical implementation, as device imperfections are frequently neglected in most QKD protocols. Some previous works proposed to use Hong-Ou-Mandel interference to quantify information leakage from side-channels. However, the security bound was relatively loose, resulting in poor performance. In this paper, we present an improved method for the security analysis of practical QKD protocols and provide a more precise parameter estimation. Furthermore, we apply it to several important QKD protocols, including BB84, measurement-device-independent, and twin-field, and carry out corresponding numerical simulations. Our work demonstrates significant improvements in both the key rate and the transmission distance compared to previous methods, representing a crucial step towards the practical implementation of QKD.
Multiparty quantum key distribution (QKD) is useful for many applications that involve secure communication or collaboration among multiple parties. While it can be achieved using pairwise QKD, a more efficient approach is to achieve it using multipartite entanglement distributed over quantum networks that connect the multiple parties. Existing studies on multipartite entanglement distribution, however, are not designed for multiparty QKD, and hence do not aim to maximize secret key generation rate. In this paper, we design efficient strategies for multiparty QKD over quantum networks. For 3-party QKD, we derive closed-form expressions for analyzing key distribution over quantum networks. We then use it to develop an efficient strategy for 3-party QKD by packing multiple stars that connect the 3 parties. For the general form of N-party QKD, we develop an approach that packs multiple trees to connect the N parties, while directly incorporating the estimated key rates on network paths. Extensive evaluation of our strategies, in both grid and random graphs, under a wide range of settings, demonstrates that our schemes achieve high key rate, which degrades gracefully when increasing the number of parties.
By testing nonlocality, the security of entanglement-based quantum key distribution (QKD) can be enhanced to being ``device-independent.'' Here we ask whether such a strong form of security could also be established for one-way (prepare and measure) QKD. While fully device-independent security is impossible, we show that security can be guaranteed against individual attacks in a semi-device-independent scenario. In the latter, the devices used by the trusted parties are noncharacterized, but the dimensionality of the quantum systems used in the protocol is assumed to be bounded. Our security proof relies on the analogies between one-way QKD, dimension witnesses, and random-access codes.