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

Quantum

Anonymous conference key agreement in linear quantum networks

Jarn de Jong, Frederik Hahn, Jens Eisert, Nathan Walk, Anna Pappa

Published Sep 21, 2023• 10 citations
Publisher

Abstract

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.

DOI
10.22331/q-2023-09-21-1117

Related papers

Anonymous conference key agreement in linear quantum networks

Jarn de Jong, Frederik Hahn, Jens Eisert +2 more

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.

arXiv:2205.09169•May 18, 2022•0 citations

Anonymous Quantum Conference Key Agreement

Frederik Hahn, Jarn de Jong, Anna Pappa

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 protocols, compared to bipartite entangled resources.The existence of secure and anonymous protocols based on multipartite entangled states provides a new insight on their potential as resources and paves the way for further applications.

arXiv:2010.04534•PRX Quantum•Dec 22, 2020•66 citations

Anonymous and secret communication in quantum networks

Christopher Thalacker, Frederik Hahn, Jarn de Jong +2 more

Abstract 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—different combinations of two and three parties—whilst keeping the participating parties anonymous. We additionally show that the protocol is verifiable and run multiple key generation and verification routines. Our work thus addresses one of the key challenges of networked communication: keeping the identities of the communicating parties private.

arXiv:2103.08722•New Journal of Physics•Jul 27, 2021•29 citations

Experimental anonymous conference key agreement using linear cluster states

Lukas Rückle, Jakob Budde, Jarn de Jong +3 more

Multipartite entanglement enables secure and anonymous key exchange between multiple parties in a network. Greenberger-Horne-Zeilinger states have been introduced as resource states for anonymous key exchange protocols, in which an anonymous subset of parties within a larger network establishes a secret key. However, the use of other types of multipartite entanglement for such protocols remains relatively unexplored. Here, we demonstrate that linear cluster states can serve as a versatile and potentially scalable resource in such applications. We implemented an anonymous key exchange protocol with four photons in a linear cluster state and established a shared key between three parties in our network. We show how to optimize the protocol parameters to account for noise and to maximize the finite key rate under realistic conditions. As cluster states have been established as a flexible resource in quantum computation, we expect that our demonstration provides a first step towards their hybrid use for networked computing and communication.

arXiv:2207.09487•Jul 19, 2022•1 citation

Experimental anonymous conference key agreement using linear cluster states

Lukas Rückle, Jakob Budde, Jarn de Jong +3 more

Multipartite entanglement enables secure and anonymous key exchange between multiple parties in a network. Greenberger-Horne-Zeilinger states have been introduced as resource states for anonymous key exchange protocols, in which an anonymous subset of parties within a larger network establishes a secret key. However, the use of other types of multipartite entanglement for such protocols remains relatively unexplored. Here, we demonstrate that linear cluster states can serve as a versatile and potentially scalable resource in such applications. We implemented an anonymous key exchange protocol with four photons in a linear cluster state and established a shared key between three parties in our network. We show how to optimize the protocol parameters to account for noise and to maximize the finite key rate under realistic conditions. As cluster states have been established as a flexible resource in quantum computation, we expect that our demonstration provides a first step towards their hybrid use for networked computing and communication.

Physical Review Research•Sep 28, 2023•8 citations

Efficient Quantum Conference Key Agreement over Quantum Networks

Samuel Oslovich, Md. Zakir Hossain, Trevor N. Thomas +3 more

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.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•3 citations
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.
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.
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 protocols, compared to bipartite entangled resources.The existence of secure and anonymous protocols based on multipartite entangled states provides a new insight on their potential as resources and paves the way for further applications.
Abstract 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—different combinations of two and three parties—whilst keeping the participating parties anonymous. We additionally show that the protocol is verifiable and run multiple key generation and verification routines. Our work thus addresses one of the key challenges of networked communication: keeping the identities of the communicating parties private.
Multipartite entanglement enables secure and anonymous key exchange between multiple parties in a network. Greenberger-Horne-Zeilinger states have been introduced as resource states for anonymous key exchange protocols, in which an anonymous subset of parties within a larger network establishes a secret key. However, the use of other types of multipartite entanglement for such protocols remains relatively unexplored. Here, we demonstrate that linear cluster states can serve as a versatile and potentially scalable resource in such applications. We implemented an anonymous key exchange protocol with four photons in a linear cluster state and established a shared key between three parties in our network. We show how to optimize the protocol parameters to account for noise and to maximize the finite key rate under realistic conditions. As cluster states have been established as a flexible resource in quantum computation, we expect that our demonstration provides a first step towards their hybrid use for networked computing and communication.
Multipartite entanglement enables secure and anonymous key exchange between multiple parties in a network. Greenberger-Horne-Zeilinger states have been introduced as resource states for anonymous key exchange protocols, in which an anonymous subset of parties within a larger network establishes a secret key. However, the use of other types of multipartite entanglement for such protocols remains relatively unexplored. Here, we demonstrate that linear cluster states can serve as a versatile and potentially scalable resource in such applications. We implemented an anonymous key exchange protocol with four photons in a linear cluster state and established a shared key between three parties in our network. We show how to optimize the protocol parameters to account for noise and to maximize the finite key rate under realistic conditions. As cluster states have been established as a flexible resource in quantum computation, we expect that our demonstration provides a first step towards their hybrid use for networked computing and communication.
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.