Fundamental limitations on the device-independent quantum conference key agreement
Karol Horodecki, Marek Winczewski, Siddhartha Das
备注：
v1: 15 pages, 2 figures. See also the parallel work by Aby Philip, Eneet Kaur, Peter Bierhorst, and Mark M. Wilde titled "Intrinsic Non-Locality and Device-Independent Conference Key Agreement" appearing on arXiv along with this work. v2: Section IV removed as it was redundant, results unchanged, typos corrected
发表信息：
Physical Review A, vol 105, issue 2, page 022604, February 2022
We provide several general upper bounds on the rate of a key secure against a quantum adversary in the device-independent conference key agreement (DI-CKA) scenario. They include bounds by reduced entanglement measures and those based on multipartite secrecy monotones such as a multipartite squashed entanglement-based measure, which we refer to as reduced c-squashed entanglement. We compare the latter bound with the known lower bound for the protocol of conference key distillation based on the parity Clauser-Horne-Shimony-Holt game. We also show that the gap between the DI-CKA rate and the device-dependent rate is inherited from the bipartite gap between device-independent and device-dependent key rates, giving examples that exhibit the strict gap.
Quantum Conference Key Agreement (QCKA) protocols are designed to allow multiple parties to agree on a shared secret key, secure against computationally unbounded adversaries. In this paper, we consider a high-dimensional QCKA protocol and prove its information theoretic security against arbitrary, general, attacks in the finite-key scenario. Our proof technique may be useful for other high-dimensional multi-party quantum cryptographic protocols. Finally, we evaluate the protocol in a variety of settings, showing that high-dimensional states can greatly benefit QCKA protocols.
In this manuscript we discuss the device-independent conference key agreement (DICKA) protocol [Phys. Rev. A 97, 022307 (2018)]. We show that the suggested honest implementation fails, because perfect correlated measurement results and the required Bell-inequality violation cannot be achieved simultaneously, in contradiction to what is claimed. We further show via semidefinite programming that there cannot exist any suitable honest implementation in the tripartite setting, rendering the DICKA protocol incomplete.
Quantum cryptography is a major ingredient of the future quantum internet that promises various secure communication tasks. Quantum conference key agreement (CKA) is an important cryptographic primitive of quantum cryptography, which provides the conference key among multiple users simultaneously. However, quantum CKA is currently far from practical application due to the low conference key rate. Here, we propose a quantum CKA protocol of three users with information-theoretic security. Our protocol only requires phase-randomized weak coherent sources and threshold single-photon detectors, and…
Quantum Conference Key Agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key. While bipartite quantum key distribution protocols are also useful in the context of CKA, multipartite protocols allow for a more efficient generation of the necessary correlations and are therefore viewed favorably in the context of quantum networks. In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that do not only want to keep their shared key secret but also protect their own identity, e.g. in the context of whis…
Conference key agreement (CKA) is an information processing task where more than two parties want to share a common secret key. Here, we present a loss-resilient protocol for CKA, based on redundant encoding and error correction. Our protocol provides a speed-up in transmission rate over the existing lossy CKA protocol. However, encoding and error correction come with extra cost. We show that, using photon sources with creation probability p > 0.3, our protocol's secret key rate can overcome the existing protocol's. Hence, high probability entangled photon sources are required for realistic im…
Entanglement plays a crucial role in the security of quantum key distribution. A secret key can only be obtained by two parties if there exists a corresponding entanglement-based description of the protocol in which entanglement is witnessed, as shown by Curty et al (2004). Here we investigate the role of entanglement for the generalization of quantum key distribution to the multipartite scenario, namely conference key agreement. In particular, we ask whether the strongest form of multipartite entanglement, namely genuine multipartite entanglement, is necessary to establish a conference key. W…
Conference key agreement (CKA), or multipartite key distribution, is a cryptographic task where more than two parties wish to establish a common secret key. A composition of bipartite quantum key distribution protocols can accomplish this task. However, the existence of multipartite quantum correlations allows for new and potentially more efficient protocols, to be applied in future quantum networks. Here, we review the existing quantum CKA protocols based on multipartite entanglement, both in the device-dependent and the device-independent scenario.
In this work, we present a new class of genuine multipartite Bell inequalities, that is particularly designed for multipartite device-independent (DI) quantum key distribution (QKD), also called DI conference key agreement. We prove the classical bounds of this inequality, discuss how to maximally violate it and show its usefulness by calculating achievable conference key rates via the violation of this Bell inequality. To this end, semidefinite programming techniques based on [Nat. Commun. 2, 238 (2011)] are employed and extended to the multipartite scenario. Our Bell inequality represents a …
The generation of GHZ states in quantum networks is a key element for the realization of several quantum information tasks. Given the complexity of the implementation of such generation, it is not easy to find an unambigous proof for an optimal protocol. Motivated by recent improvements in NV center manipulation, we present and compare an extensive list of protocols for generating GHZ states using realistic parameters. Furthermore, in order to establish the goodness of the various protocols, we test them on a specific application, i.e. conference key agreement. We show that for an high number …
As an essential ingredient of quantum networks, quantum conference key agreement (QCKA) provides unconditional secret keys among multiple parties, which enables only legitimate users to decrypt the encrypted message. Recently, some QCKA protocols employing twin-field was proposed to promote transmission distance. These protocols, however, suffer from relatively low conference key rate and short transmission distance over asymmetric channels, which demands a prompt solution in practice. Here, we consider a tripartite QCKA protocol utilizing the idea of sending-or-not-sending twin-field scheme a…
Quantum conference key agreement (CKA) enables key sharing among multiple trusted users with information-theoretic security. Currently, the key rates of most quantum CKA protocols suffer from the limit of the total efficiency among quantum channels. Inspired by the coherent one-way and twin-field quantum key distribution (QKD) protocols, we propose a quantum CKA protocol of three users. Exploiting coherent states with intensity 0 and $μ$ to encode logic bits, our protocol can break the limit. Additionally, the requirements of phase randomization and multiple intensity modulation are removed in…
Conference Key Agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key. In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that want to keep their shared key secret and at the same time protect their own identity. We provide a definition of anonymity for general protocols and present a CKA protocol that is provably anonymous under realistic adversarial scenarios. We base our protocol on shared Greenberger-Horne-Zeilinger states, which have been proposed as more efficient resources for CKA protoco…
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Traditional quantum communication protocols consume pair-wise entanglement, which is sub-optimal for distributed tasks involving more than two users. Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement to efficiently create identical keys between N users with up to N-1 rate advantage in constrained networks. We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brigh…
The intense research activity on Twin-Field (TF) quantum key distribution (QKD) is motivated by the fact that two users can establish a secret key by relying on single-photon interference in an untrusted node. Thanks to this feature, variants of the protocol have been proven to beat the point-to-point private capacity of a lossy quantum channel. Here we generalize the main idea of the TF-QKD protocol introduced by Curty et al. to the multipartite scenario, by devising a conference key agreement (CKA) where the users simultaneously distill a secret conference key through single-photon interfere…
We present the first 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, we introduce the "Parity-CHSH" inequality), and security can in principle be obtained for any violation of the Parity-CHSH inequality. We use a direct connection between the $N$-partite Parity-CHSH inequality and the CHSH inequality. Namely, the Parity-CHSH inequality can be considered as a CHSH inequality or another CHSH inequality (equivalent up to…
Pauli Error Composition Determines the Multipartite Advantage in Conference Key Agreement
The Coding School dba Frontier Technology Institute（Frontier Technology Institute）；Department of Computer Science, University of Maryland, College Park, Maryland, USA（马里兰大学）
该研究通过精确模拟不同噪声下的 GHZ 会议密钥协商协议，发现 Pauli 错误组成决定其相对 BB84 的多体优势，并推导闭式速率证明噪声分散优于集中。
Performance Analysis of Multiparty GHZ-State Quantum Conference Key Agreement over Optical Fiber Channel
Indian Institute of Technology Delhi（印度德里理工学院）；Centre for Applied Research in Electronics (CARE)（电子应用研究中心）；Bharti School of Telecommunication Technology and Management（Bharti电信技术与管理学院）；University of Melbourne（墨尔本大学）
Improving the Loss Tolerance of Heralded Photonic GHZ States for Long-Distance Device-Independent Conference Key Agreement
Imperial College London（帝国理工学院）；Keio University（庆应义塾大学）；Curtin University（科廷大学）；University of Oxford（牛津大学）；National Institute of Information and Communications Technology (NICT)（信息通信研究机构）
Secret-sharing building blocks based on quantum broadcast communication are studied. The confidential capacity region of the pure-loss bosonic broadcast channel is determined, both with and without key assistance, and an achievable region is established for the lossy bosonic broadcast channel. If the main receiver has a transmissivity of η<1/2, then confidentiality solely relies on the key-assisted encryption of the one-time pad. We also address conference key agreement for the distillation of two keys, a public key and a secret key. A regularized formula is derived for the key-agreement capac…
Users of quantum networks can securely communicate via so-called (quantum) conference key agreement --making their identities publicly known. In certain circumstances, however, communicating users demand anonymity. Here, we introduce a security framework for anonymous conference key agreement with different levels of anonymity, which is inspired by the epsilon-security of quantum key distribution. We present efficient and noise-tolerant protocols exploiting multipartite Greenberger-Horne-Zeilinger (GHZ) states and prove their security in the finite-key regime. We analyze the performance of our…
We propose one of the very few constructive consequences of the second law of thermodynamics. More specifically, we present protocols for secret-key establishment and multiparty computation the security of which is based fundamentally on Landauer's principle. The latter states that the erasure cost of each bit of information is at least kTln2 (where k is Boltzmann's constant and T is the absolute temperature of the environment). Albeit impractical, our protocols explore the limits of reversible computation, and the only assumption about the adversary is her inability to access a quantity of fr…
We consider the distribution of secret keys, both in a bipartite and a multipartite (conference) setting, via a quantum network and establish a framework to obtain bounds on the achievable rates. We show that any multipartite private state--the output of a protocol distilling secret key among the trusted parties--has to be genuinely multipartite entangled. In order to describe general network settings, we introduce a multiplex quantum channel, which links an arbitrary number of parties, where each party can take the role of sender only, receiver only, or both sender and receiver. We define asy…
Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only limited advantages over classical ones. First, we show that $\mathsf{BQP/qpoly}\subseteq\mathsf{PP/poly}$, where $\mathsf{BQP/qpoly}$ is the class of problems solvable in quantum polynomial time, given a polynomial-size "quantum advice state" that depends only on the input length. This resolves a question of Buhrman, and means that we should not hope for an …
Secure communication is one of the key applications of quantum networks. In recent years, following the demands for identity protection in classical communication protocols, the need for anonymity has also emerged for quantum networks. Here, we demonstrate that quantum physics allows parties - besides communicating securely over a network - to also keep their identities secret. We implement such an anonymous quantum conference key agreement by sharing multipartite entangled states in a quantum network. We demonstrate the protocol with four parties and establish keys in subsets of the network -…
We proposed a framework of quantum-enhanced logic-based blockchain, which improves the efficiency and power of quantum-secured blockchain. The efficiency is improved by using a new quantum honest-success Byzantine agreement protocol to replace the classical Byzantine agreement protocol, while the power is improved by incorporating quantum protection and quantum certificate into the syntax of transactions. Our quantum-secured logic-based blockchain can already be implemented by the current technology. The cryptocurrency created and transferred in our blockchain is called qulogicoin. Incorporati…
Security of passive entanglement-based key distribution protocols
Network Innovation Laboratories, NTT, Inc.（NTT网络创新实验室）；NTT Research Center for Theoretical Quantum Information, NTT, Inc.（NTT理论量子信息研究中心）；Basic Research Laboratories, NTT, Inc.（NTT基础研究所）
