[Paper Review] Experimental implementation of secure anonymous protocols on an eight-user quantum network

Zixin Huang, Siddarth Koduru Joshi+13 more|arXiv (Cornell University)|Nov 18, 2020

Quantum Information and Cryptography2 references4 citations

TL;DR

This paper demonstrates the first experimental implementation of five information-theoretically secure anonymous protocols—anonymous broadcasting, veto, notification, collision detection, and private message transmission—on an 8-user metropolitan quantum network using polarization-entangled photon pairs. The protocols achieve sender anonymity even if up to n−2 users are dishonest, leveraging pre-shared secret keys from QKD and minimal classical communication, marking a major step toward practical privacy-preserving quantum networks beyond point-to-point key distribution.

ABSTRACT

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here we experimentally demonstrate 5 information-theoretically secure anonymity protocols on an 8 user city-wide quantum network using polarisation-entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping her identity anonymous. For a network of $n$ users, the protocols retain anonymity for the sender, given less than $n-2$ users are dishonest. This is one of the earliest implementations of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.

Motivation & Objective

• To implement practical, information-theoretically secure anonymous communication protocols in a real-world quantum network, addressing privacy beyond confidentiality.
• To demonstrate that anonymity can be achieved in a fully-connected quantum network without trusted nodes, using only pairwise entanglement and QKD-generated keys.
• To extend quantum network functionality beyond standard QKD by enabling primitives like anonymous broadcasting and veto, essential for applications such as secret voting and private messaging.
• To validate the scalability and robustness of anonymous protocols under realistic network conditions, including error tolerance and classical communication overhead.
• To establish a foundation for future anonymous network control planes and decentralized privacy-preserving applications in quantum internet architectures.

Proposed method

• The network uses polarization-entangled photon pairs distributed via a metropolitan quantum network testbed to establish pairwise secret keys between all 8 users using QKD.
• Anonymous broadcasting is implemented as the core primitive, allowing one user to transmit a single bit while remaining unidentifiable, with security preserved if fewer than n−2 users are dishonest.
• The protocols are constructed using classical communication over authenticated channels, with all operations based on the shared secret keys and the parity operation from Broadbent and Tapp (2007).
• Collision detection and notification protocols are built using repeated anonymous broadcasting, with overheads scaling as O(n²) due to key consumption and coordination.
• Private message transmission is encoded using a one-time pad scheme over anonymous channels, enabling secure, arbitrary-length messages between users.
• Error resilience is achieved by incorporating error detection and retransmission mechanisms, with theoretical analysis showing tolerance to key errors (see Appendix D).

Experimental results

Research questions

• RQ1 Can information-theoretically secure anonymous communication be experimentally realized in a multi-user quantum network without trusted nodes?
• RQ2 How can anonymous broadcasting be implemented efficiently using only pairwise entanglement and QKD-derived keys?
• RQ3 What is the classical communication and key consumption overhead of implementing anonymous protocols like veto, notification, and collision detection?
• RQ4 To what extent are these protocols robust against errors in the secret keys used for authentication and encoding?
• RQ5 Can anonymous protocols be composed to enable complex privacy-preserving applications such as secret voting or anonymous messaging?

Key findings

• The anonymous broadcasting protocol achieves a throughput equal to the minimum key rate of the quantum network, with only minimal classical communication overhead—limited to announcing the final parity.
• The veto and notification protocols each require at most nβ rounds of anonymous broadcasting, with β being the number of rounds needed for key verification, and scale efficiently with network size.
• The collision detection protocol consumes O(n²) secret bits due to the need for pairwise coordination, but can be optimized to approach a rate arbitrarily close to 1 with sufficient key length.
• The private message transmission protocol enables secure, arbitrary-length message exchange between users, with information-theoretic security ensured by one-time pad encryption over anonymous channels.
• The protocols are resilient to errors in the secret keys, with theoretical analysis confirming robustness under realistic error conditions (Appendix D).
• This experiment represents one of the first implementations of non-trivial, multi-user cryptographic protocols beyond point-to-point QKD on a real quantum network, demonstrating the feasibility of privacy-preserving quantum communication.