Abstract Conference key agreement (CKA) enables multiple parties to establish a shared secret key, and semi-quantum protocols aim to achieve this even when some participants have limited quantum capabilities. We propose a semi-quantum CKA (SQCKA) protocol that leverages on GHZ states. We provide a comprehensive security analysis for our protocol that does not rely on a trusted mediator party. We present information-theoretic security proof, addressing collective attacks within the asymptotic limit of infinitely many rounds. This assumption is practical, as participants can monitor and abort the protocol if deviations from expected noise patterns occur. This advancement enhances the feasibility of SQCKA protocols for real-world applications, ensuring strong security without complex network topologies or third-party trust.
Abstract Conference key agreement (CKA) enables multiple parties to establish a shared secret key, and semi-quantum protocols aim to achieve this even when some participants have limited quantum capabilities. We propose a semi-quantum CKA (SQCKA) protocol that leverages on GHZ states. We provide a comprehensive security analysis for our protocol that does not rely on a trusted mediator party. We present information-theoretic security proof, addressing collective attacks within the asymptotic limit of infinitely many rounds. This assumption is practical, as participants can monitor and abort the protocol if deviations from expected noise patterns occur. This advancement enhances the feasibility of SQCKA protocols for real-world applications, ensuring strong security without complex network topologies or third-party trust.
Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA), an extension of key distribution to multiple parties, has received much attention recently. Interestingly, CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity. In this work, we propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting. Specifically, a line of quantum repeater nodes is used to build a linear cluster state among all nodes, which is then used to anonymously establish a secret key between any three of them. The nodes need only share maximally entangled pairs with their neighbours, therefore avoiding the necessity of a central server sharing entangled states. This repeater setup makes our protocol an excellent candidate for implementation in future quantum networks. We explicitly prove that our protocol protects the identities of the participants from one another and perform an analysis of the key rate in the finite regime, contributing to the quest of identifying feasible quantum communication tasks for network architectures beyond point-to-point.
Abstract Quantum secret sharing (QSS) and conference key agreement (CKA) provide efficient encryption approaches for realizing multi-party secure communication, which are essential components of quantum networks. In this work, a practical, scalable, verifiable ( k , n ) threshold continuous variable QSS protocol secure against eavesdroppers and dishonest players are proposed and demonstrated. The protocol does not require preparing the laser source by each player and phase locking of independent lasers. The parameter evaluation and key extraction can be accomplished by only the dealer and the corresponding player. By using the multiple sideband modulation, a single heterodyne detector can extract the information of multiple players. The practical security of the system is considered. The system is versatile, it can support the CKA protocol by only modifying the classic post-processing and requiring no changes to the underlying hardware architecture. By implementing the QSS and CKA protocols with five parties over 25 km (55 km) single-mode fibers, a key rate of 0.0061 (7.14 × 10 −4 ) bits per pulse is observed. The results significantly reduces the system complexity and paves the way for the practical applications of QSS and CKA with efficient utilization of resources and telecom technologies.
Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA) - an extension of key distribution to multiple parties - has received much attention recently. Interestingly, CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity . In this work, we propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting. Specifically, a line of quantum repeater nodes is used to build a linear cluster state among all nodes, which is then used to anonymously establish a secret key between any three of them. The nodes need only share maximally entangled pairs with their neighbours, therefore avoiding the necessity of a central server sharing entangled states. This linear chain setup makes our protocol an excellent candidate for implementation in future quantum networks. We explicitly prove that our protocol protects the identities of the participants from one another and perform an analysis of the key rate in the finite regime, contributing to the quest of identifying feasible quantum communication tasks for network architectures beyond point-to-point.
Quantum conference key agreement (CKA) is useful for many applications that involve secure communication or collaboration among multiple parties. While CKA over quantum networks can be achieved using pairwise quantum key distribution, a more efficient approach is to establish keys among the parties directly through multipartite entanglement distribution. Existing studies on multipartite entanglement distribution, however, are not designed for CKA, and hence do not aim to optimize key rate. In this paper, we first develop an efficient 3-party CKA strategy based on a closed-form expression that we derive for estimating errors. We then develop a general strategy for N-party CKA that accounts for estimated key rates on individual network paths. For both cases, we use multipath routing to improve key rate. We evaluate our approach in a wide range of settings and demonstrate that it achieves high key rate and degrades gracefully when increasing the number of parties.
Abstract Multi-party quantum key sharing is the foundation for constructing quantum communication networks. The source-independent quantum conference key agreement (QCKA) distributes multiple Bell state pairs, which are post-processed to construct equivalent Greenberger-Horne-Zeilinger (GHZ) states and achieve multi-party key sharing. This helps maintain key rates at reasonable levels as the number of users increases, improving practicality and scalability. However, in the original source-independent QCKA protocol, the users receiving Bell states are assumed to be symmetrically distributed, which actually contradicts the distinct functional roles of the protocol participants (Alice and Bobs), and also limits the conference key rate of the protocol. To address this, we propose a source-independent QCKA protocol under an asymmetric architecture and perform simulations using parameters from existing commercial products, increasing the conference key rate and reducing deployment costs in practical applications.
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 multiparty quantum cryptographic protocols. Finally, we evaluate the protocol in a variety of settings, showing that high-dimensional states can greatly benefit QCKA protocols.